On solving the nonlinear bilevel programming problem
Conference
·
OSTI ID:35874
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--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Resolving degeneracy in an exact penality function technique for nonlinear bilevel optimization
Approximations for generalized bilevel programming problem
Global methods for optimizing over the efficient set
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35875
Approximations for generalized bilevel programming problem
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36302
Global methods for optimizing over the efficient set
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36638