Successive convex relaxation approach to bilevel quadratic optimization problems (Q2760111)
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: Successive convex relaxation approach to bilevel quadratic optimization problems |
scientific article; zbMATH DE number 1684116
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Successive convex relaxation approach to bilevel quadratic optimization problems |
scientific article; zbMATH DE number 1684116 |
Statements
18 December 2001
0 references
bilevel programming
0 references
semi-infinite LP relaxation
0 references
reformulation-linearization technique
0 references
lift-and-project
0 references
bilevel quadratic optimization
0 references
hierarchical decision process
0 references
nonconvex quadratic optimization
0 references
complementarity
0 references
successive convex relaxation method
0 references
Successive convex relaxation approach to bilevel quadratic optimization problems (English)
0 references
