An algorithm for general multilevel linear/linear fractional programming problems
by Shifali Bhargava; Dinesh K. Sharma
International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO), Vol. 7, No. 1, 2016

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.

Online publication date: Mon, 25-Jan-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com