A Constructive Proof of the Representation Theorem for Polyhedral Sets Based on Fundamental Definitions
From MaRDI portal
Publication:3200878
DOI10.1080/01966324.1987.10737221zbMath0714.90061OpenAlexW2312608158WikidataQ58263494 ScholiaQ58263494MaRDI QIDQ3200878
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
representation theoremextreme pointspolynomial time algorithmgeometric conceptsCaratheodory's theoremresolution theorem
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05)
Related Items
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 ⋮ Global optimization of nonconvex problems with multilinear intermediates
Cites Work