An algorithm for non-linear multi-level integer programming problems
by Ritu Arora, S.R. Arora
International Journal of Computing Science and Mathematics (IJCSM), Vol. 3, No. 3, 2010

Abstract: In this paper, an algorithm is proposed to solve a tri-level integer programming problem in which the objective function for the first level is an indefinite quadratic, the second one is linear and the third one is linear fractional. The feasible space of the decision variable is reduced at each level until a satisfactory point is obtained at the last level. The higher level decision-maker reduces the feasible space for the lower level decision maker to search for his optimum. A satisfactory solution of the bilevel decentralised programming problem can also be obtained by the method proposed above. This method is illustrated with the help of examples.

Online publication date: Mon, 13-Dec-2010

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 Computing Science and Mathematics (IJCSM):
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