A Constructive Proof of the Representation Theorem for Polyhedral Sets Based on Fundamental Definitions
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3141674 (Why is no real title available?)
- scientific article; zbMATH DE number 3724172 (Why is no real title available?)
- scientific article; zbMATH DE number 2166303 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- Convex Analysis
- Decomposition Principle for Linear Programs
- Foundations of optimization
- Partitioning procedures for solving mixed-variables programming problems
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)
