On the construction of initial polyhedral convex set for optimization problems over the efficient set and bilevel linear programs

MaRDI QIDQ1593702zbMATH OpenFDO

Authors Le Dung Muu

Publication date 8 July 2001

Published in Vietnam Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

bilevel linear programsdecomposition branch-and-bound algorithmefficient setmultiple objective linear programouter and inner approximationspolyhedral bisectionwell initiated polyhedron

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46)

Review text

It is well known that several techniques in optimization require the construction of an initial polyhedral convex set whose vertices and extreme directions are easy to calculate. This short note is devoted to the construction of a well initiated polyhedron meaning that this set contains an optimal solution and is not beyond the domain where the objective function and constraints are defined. For optimization problems over the efficient set of a multiple objective linear program and bilevel linear programs the author makes use of outer and inner approximations for the construction of such a set. In case such a set is neither a simplex, a cone, nor a rectangle, then the author makes use of polyhedral bisection developed in convex-concave programming to obtain a decomposition branch-and-bound algorithm for solving bilevel linear programs.

Recommendations

• scientific article; zbMATH DE number 1163117
• Bilevel problems over polyhedra with extreme point optimal solutions
• Linear bilevel programs with multiple objectives at the upper level
• The bilevel linear/linear fractional programming problem
• Optimizing a linear function over an efficient set

Cited in

(2)

• Bilevel optimization: theory, algorithms, applications and a bibliography
• A neurodynamic approach for a class of pseudoconvex semivectorial bilevel optimization problems

This page was built for publication: On the construction of initial polyhedral convex set for optimization problems over the efficient set and bilevel linear programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1593702)