International Competition Enhance Capacity Utilisation: The Evidence from Indonesia, Philippines and Vietnam | Chapter 8 | Insights into Economics and Management Vol. 11

 Using firm-level data from Indonesia, the Philippines, and Vietnam, this research investigates the relationship between capacity utilisation and international market rivalry, exploring for the prospect of efficient businesses self-selecting rather than learning-by-exporting to enter foreign markets. Capacity utilisation has evolved as a justification for these fleeting productivity gains. According to both linear and quadratic models calculated on an uneven variance of exporting and non-exporting companies, the influence of foreign market rivalry on capacity utilisation follows a curvilinear relationship with a diminishing marginal point as a limitation for further expansion. The non-exporting group's greater capacity utilisation rate not only demonstrates a strong domestic business orientation of enterprises in general, but it also suggests that exporter SMEs in these nations have chosen the learning-by-exporting entrance approach. The impact of firm and industry physiognomies on capacity utilisation is investigated further in the article, which discovers that wage productivity, competition, company size, and legal structure all have linearly positive and capacity-based effects. The findings continuously stress the relevance of abilities, competitiveness, and institutional performance in encouraging the development of SMEs.

Author (s) Details

Rita R. Pidani
Newcastle Business School, Faculty of Business and Law, The University of Newcastle, Singapore.

Amir Mahmood
Newcastle Business School, Faculty of Business and Law, The University of Newcastle, Singapore.

View Book :- https://stm.bookpi.org/IEAM-V11/article/view/1329

Computing and Applications: The Maximum Flow and Minimum Cost – Maximum Flow Problems | Chapter 6 | Theory and Practice of Mathematics and Computer Science Vol. 10

 Both the maximum flow and minimum cost-maximum flow challenges are concerned with determining flows between a source and a destination across a network. The term "maximum flow" refers to any problem in which the goal is to transport as many products, objects, or people as possible between two sites via intermediate places. Maximum flow-lowest cost refers to flow problems including both capacities and expenses. Computing enables one to come at a solution to a problem when provided knowledge about a network (network flow diagram, capacities, and expenses). When the solution is ready, it must be tested on a real-world problem. The usage of R (many packages and functions), specially designed Pascal programmes, and Excel SOLVER in the solution of these problems will be discussed. The following problems' minimum cost-maximum flow solutions will also be discussed: Transportation problem, assignment problem, shortest path problem, caterer problem, maximum flow, minimum cost-maximum flow.

Author(s) Details

W. H. Moolman
Department of Mathematical Sciences and Computing, Walter Sisulu University, Mthatha, South Africa.

View Book :- https://stm.bookpi.org/TPMCS-V10/article/view/1076