On minimal generators for semi-closed polyhedra

DOI10.1080/02331934.2013.820299zbMATH Open1316.52018OpenAlexW1974369130MaRDI QIDQ5248201FDOQ5248201

Authors: Ya Ping Fang, Kaiwen Meng, 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

Recommendations

• Polynomial representations of polyhedra
• A representation of generalized convex polyhedra and applications
• Minimal polynomial descriptions of polyhedra and special semialgebraic sets
• scientific article; zbMATH DE number 1860737
• The representation polyhedron of a semiorder.

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)

Cites Work

• Variational Analysis
• Lectures on Polytopes
• Title not available (Why is that?)
• Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
• Structure and weak sharp minimum of the Pareto solution set for piecewise linear multiobjective optimization
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces
• Piecewise linear multicriteria programs: the continuous case and its discontinuous generalization
• An Algorithm for Finding All Vertices of Convex Polyhedral Sets
• Note on prime representations of convex polyhedral sets

Cited In (3)

• Piecewise linear vector optimization problems on locally convex Hausdorff topological vector spaces
• On finite linear systems containing strict inequalities
• Title not available (Why is that?)

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

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