A linear bilevel programming algorithm based on bicriteria programming (Q581254)

From MaRDI portal
Revision as of 12:30, 18 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A linear bilevel programming algorithm based on bicriteria programming
scientific article

    Statements

    A linear bilevel programming algorithm based on bicriteria programming (English)
    0 references
    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
    0 references
    bilevel linear programming
    0 references
    bicriteria linear programming
    0 references
    Grid Search
    0 references
    0 references