On the Non-Linear Multilevel Programming Problems

In this paper a multilevel programming problem viz. three level programming problem (TPP) 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 lev...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Opsearch Ročník 43; číslo 1; s. 49 - 62
Hlavní autori: Arora, S. R., Gaur, Anuradha
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New Delhi Springer Nature B.V 01.03.2006
Predmet:
Mathematical programming
Multilevel
Nonlinear programming
Operations research
Optimization
Polyhedra
Quadratic programming
ISSN:0030-3887, 0975-0320
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper a multilevel programming problem viz. three level programming problem (TPP) 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. At first it is shown that minimizing the indefinite quadratic programming problem is equivalent to minimizing a quasiconcave function over a feasible region comprised of the faces of the convex polyhedron. Also, the second objective function being linear and the third being linear fractional, the optimal solution occurs at an extreme point. It is illustrated with the help of an example.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0030-3887
0975-0320
DOI:10.1007/BF03398760