A polynomially solvable class of two-level nonlinear programming problems (Q2713938)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomially solvable class of two-level nonlinear programming problems |
scientific article; zbMATH DE number 1603197
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomially solvable class of two-level nonlinear programming problems |
scientific article; zbMATH DE number 1603197 |
Statements
10 June 2001
0 references
branch-and-bound rule
0 references
polynomial hierarchy
0 references
bilevel programming
0 references
A polynomially solvable class of two-level nonlinear programming problems (English)
0 references
The author studies a two-level programming problem with constraints containing some special nonlinear terms. He proves that the problem can be reduced to a series of linear programming problems and, thus, has polynomial complexity.
0 references
