Integrating goal programming, Kuhn-Tucker conditions, and penalty function approaches to solve linear bi-level programming problems (Q2470166)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5234836
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Integrating goal programming, Kuhn-Tucker conditions, and penalty function approaches to solve linear bi-level programming problems |
scientific article; zbMATH DE number 5234836 |
Statements
Integrating goal programming, Kuhn-Tucker conditions, and penalty function approaches to solve linear bi-level programming problems (English)
0 references
13 February 2008
0 references
The bi-level programming problem is an optimization problem whose constraints are (in part) determined by solving another optimization problem. The authors integrate goal programming, Kuhn-Tucker conditions and penalty function approaches to solve linear bi-level programming problems.
0 references
nonlinear programming
0 references
bi-level programming
0 references
goal programming
0 references
penalty function
0 references
Kuhn-Tucker conditions
0 references
0.8152189254760742
0 references
0.8143742680549622
0 references
0.8010880947113037
0 references
