On polyhedral extension of some LP theorems
From MaRDI portal
Recommendations
- On the \(L_{p}\) Minkowski problem for polytopes
- Some problems related to extensions of polytopes
- Extension of M-convexity and L-convexity to polyhedral convex functions
- Maximum semidefinite and linear extension complexity of families of polytopes
- Extension complexity of low-dimensional polytopes
- Extremal problems on convex lattice polygons in sense of l_p-metrics
- On the existence of 0/1 polytopes with high semidefinite extension complexity
- On the existence of 0/1 polytopes with high semidefinite extension complexity
Cites work
- Boundedness relations for linear constraint sets
- Complementarity Theorems for Linear Programming
- Convex Analysis
- Duality in Homogeneous Programming
- scientific article; zbMATH DE number 3121281 (Why is no real title available?)
- scientific article; zbMATH DE number 3121284 (Why is no real title available?)
- scientific article; zbMATH DE number 3788387 (Why is no real title available?)
- Polyhedral extensions of some theorems of linear programming
- Rudin Varieties in Products of Two Annuli
Cited in
(5)- Weighting factor results in vector optimization
- Maximum semidefinite and linear extension complexity of families of polytopes
- A complementarity partition theorem for multifold conic systems
- Zum Satz von Tucker bei linearen optimalproblemen in halbgeordneten vektorraumen
- Facial reduction and partial polyhedrality
This page was built for publication: On polyhedral extension of some LP theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3683895)
