Authors: Shifali Bhargava; Dinesh K. Sharma
Addresses: Department of Mathematics, BSA College, Mathura (UP), India ' Department of Business, Management and Accounting, University of Maryland Eastern Shore, Princess Anne, MD 21853, USA
Abstract: In this study, we propose an enumerative algorithm to find the global optima of the general multi-level linear/linear fractional programming problem in which the objective function of the first level is linear and the other levels are linear fractional and the dominance value is assigned at each level. The feasible region of the problem is considered as a polyhedron. We demonstrate the feasibility of the proposed approach by its application to a multi-national company with the help of a numerical example.
Keywords: multi-level programming; MLP; linear fractional programming; Dinkelbach algorithm; global optima; multinational corporations; MNCs.
International Journal of Mathematical Modelling and Numerical Optimisation, 2016 Vol.7 No.1, pp.33 - 43
Received: 24 Jan 2015
Accepted: 27 Jun 2015
Published online: 23 Jan 2016 *