On the Determination of Minimal Facets and Edges of a Polyhedral Set

DOI<17::AID-MCDA115>3.0.CO;2-8 10.1002/(SICI)1099-1360(199701)6:1<17::AID-MCDA115>3.0.CO;2-8zbMath0892.90154OpenAlexW2050106098MaRDI QIDQ4368582

Johannes Jahn

Publication date: 4 December 1997

Full work available at URL: https://doi.org/10.1002/(sici)1099-1360(199701)6:1<17::aid-mcda115>3.0.co;2-8

zbMATH Keywords

vector optimizationpolyhedral setconvex polyhedral setminimal facetsminimal irredundant proper edges

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Multi-objective and goal programming (90C29)

Related Items (1)

Hybrid approach for solving multiple-objective linear programs in outcome space

This page was built for publication: On the Determination of Minimal Facets and Edges of a Polyhedral Set