On minimal generators for semi-closed polyhedra

DOI10.1080/02331934.2013.820299zbMath1316.52018OpenAlexW1974369130MaRDI QIDQ5248201

Kaiwen Meng, Ya-Ping Fang, Xiao Qi Yang

Publication date: 28 April 2015

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2013.820299

zbMATH Keywords

generatorsminimal representationrefining criteriasemi-closed polyhedra

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computational aspects related to convexity (52B55)

Related Items (2)

On finite linear systems containing strict inequalities ⋮ Piecewise linear vector optimization problems on locally convex Hausdorff topological vector spaces

Cites Work

• Unnamed Item
• Structure and weak sharp minimum of the Pareto solution set for piecewise linear multiobjective optimization
• Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces
• Note on prime representations of convex polyhedral sets
• Piecewise Linear Multicriteria Programs: The Continuous Case and Its Discontinuous Generalization
• Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
• An Algorithm for Finding All Vertices of Convex Polyhedral Sets
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• Lectures on Polytopes
• Variational Analysis

This page was built for publication: On minimal generators for semi-closed polyhedra