Nonlinear integer bilevel programming (Q1328581)
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: Nonlinear integer bilevel programming |
scientific article; zbMATH DE number 611318
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nonlinear integer bilevel programming |
scientific article; zbMATH DE number 611318 |
Statements
Nonlinear integer bilevel programming (English)
0 references
26 July 1994
0 references
A lot of practical problems can be formulated as a multi-level programming problem. It contains a sequence of objective functions and everyone of them must be optimized on a part of the variables. The paper presents an algorithm for so-called separable integer monotone bilevel programming problems. A numerical example is given.
0 references
multi-level programming
0 references
sequence of objective functions
0 references
separable integer monotone bilevel programming problems
0 references
0 references
0 references
0 references
0 references
0.92267495
0 references
0.91866636
0 references
0.91844356
0 references
0.9155591
0 references
0.91478896
0 references
