Open AccessAn enumerative algorithm for non-linear multi-level integer programming problem
Author(s) -
Ritu Narang,
S. R. Arora
Publication year - 2009
Publication title -
yugoslav journal of operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.221
H-Index - 21
eISSN - 1820-743X
pISSN - 0354-0243
DOI - 10.2298/yjor0902263n
Subject(s) - polyhedron , linear programming , mathematical optimization , mathematics , linear fractional programming , criss cross algorithm , integer programming , cutting stock problem , coefficient matrix , algorithm , constraint (computer aided design) , matrix (chemical analysis) , optimization problem , combinatorics , eigenvalues and eigenvectors , physics , quantum mechanics , geometry , materials science , composite material
In this paper a multilevel programming problem, that is, three level programming problem is considered. It involves three optimization problems where the constraint region of the first level problem is implicitly determined by two other optimization problems. The objective function of the first level is indefinite quadratic, the second one is linear and the third one is linear fractional. The feasible region is a convex polyhedron. Considering the relationship between feasible solutions to the problem and bases of the coefficient sub-matrix associated to the variables of the third level, an enumerative algorithm is proposed, which finds an optimum solution to the given problem. It is illustrated with the help of an example.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom