A linear bilevel programming algorithm based on bicriteria programming (Q581254)
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 4018798
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear bilevel programming algorithm based on bicriteria programming |
scientific article; zbMATH DE number 4018798 |
Statements
A linear bilevel programming algorithm based on bicriteria programming (English)
0 references
1987
0 references
A previous result on the relationship between bilevel linear programming (two objective functions are sequentially optimized with respect to two disjoint subsets of interdependent variables) and bicriteria linear programming is made more precise. An adaption of a bicriteria algorithm is proposed for solving the bilevel problem. The new algorithm is tested on a number of randomly generated problems and its computational performances are compared to a previous ``Grid Search Algorithm''.
0 references
bilevel linear programming
0 references
bicriteria linear programming
0 references
Grid Search
0 references
0 references
0.903160035610199
0 references
0.8552916049957275
0 references
0.8513854742050171
0 references
0.8489707112312317
0 references
