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

zbMath0963.90074MaRDI QIDQ1593702

Le Dung Muu

Publication date: 8 July 2001

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

zbMATH Keywords

efficient setmultiple objective linear programbilevel linear programsdecomposition branch-and-bound algorithmouter and inner approximationspolyhedral bisectionwell initiated polyhedron

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46)

Related Items (1)

Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

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