On solving the nonlinear bilevel programming problem

Conference · Sat Dec 31 00:00:00 EST 1994

OSTI ID:35874

Calamai, P; Conn, A

The general bilevel programming problem is a mathematical program consisting of two nonlinear optimization problems connected by a solution constraint: min{sub x,y} F(x,y) subject to x {element_of} X, y {element_of} R(x), where R(x) = arg min{sub y} {l_brace}f(x, y) : y {element_of} Y (x){r_brace}.

• OSTI ID: 35874
• Report Number(s): CONF-9408161-; TRN: 94:009753-0136
• Resource Relation: Conference: 15. international symposium on mathematical programming, Ann Arbor, MI (United States), 15-19 Aug 1994; Other Information: PBD: 1994; Related Information: Is Part Of Mathematical programming: State of the art 1994; Birge, J.R.; Murty, K.G. [eds.]; PB: 312 p.
• Country of Publication: United States
• Language: English

Related Subjects

99 MATHEMATICS
COMPUTERS
INFORMATION SCIENCE
MANAGEMENT
LAW
MISCELLANEOUS
MATRICES
NUMERICAL SOLUTION
EFFICIENCY
ALGORITHMS
NONLINEAR PROBLEMS
VARIATIONAL METHODS