A Constructive Proof of the Representation Theorem for Polyhedral Sets Based on Fundamental Definitions
DOI10.1080/01966324.1987.10737221zbMATH Open0714.90061OpenAlexW2312608158WikidataQ58263494 ScholiaQ58263494MaRDI QIDQ3200878FDOQ3200878
Authors: Hanif D. Sherali
Publication date: 1987
Published in: American Journal of Mathematical and Management Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01966324.1987.10737221
Recommendations
- Polynomial representations of polyhedra
- A representation of generalized convex polyhedra and applications
- Generalization of the representation theorem of convex combinations of convex polyhedra extreme points in Euclidean space
- Note on prime representations of convex polyhedral sets
- scientific article; zbMATH DE number 17712
representation theoremextreme pointspolynomial time algorithmgeometric conceptsCaratheodory's theoremresolution theorem
Linear programming (90C05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
Cites Work
Cited In (5)
- Note on prime representations of convex polyhedral sets
- Global optimization of nonconvex problems with multilinear intermediates
- Generalization of the representation theorem of convex combinations of convex polyhedra extreme points in Euclidean space
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
- Motivated proofs: what they are, why they matter and how to write them
This page was built for publication: A Constructive Proof of the Representation Theorem for Polyhedral Sets Based on Fundamental Definitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3200878)