Classifying convex extremum problems over linear topologies having separation properties
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3113083 (Why is no real title available?)
- scientific article; zbMATH DE number 3121286 (Why is no real title available?)
- scientific article; zbMATH DE number 3298088 (Why is no real title available?)
- scientific article; zbMATH DE number 3306918 (Why is no real title available?)
- scientific article; zbMATH DE number 3320765 (Why is no real title available?)
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- scientific article; zbMATH DE number 3420479 (Why is no real title available?)
- scientific article; zbMATH DE number 3194008 (Why is no real title available?)
- scientific article; zbMATH DE number 3084780 (Why is no real title available?)
- A note on duality gaps in linear programming over convex sets
- Asymptotic cones and duality of linear relations
- Asymptotic duality over closed convex sets
- Classification Schemes for the Strong Duality of Linear Programming Over Cones
- Convex analysis treated by linear programming
- Duality and stability in extremum problems involving convex functions
- Erratum: Asymptotic duality over closed convex sets
- Linear Programming in Reflexive Spaces
- Linear programs in topological vector spaces
- Non-Chebyshevian Moment Problems
- Nonconvex Linear Topologies with the Hahn Banach Extension Property
- On Refinements of Some Duality Theorems in Linear Programming over Cones
- On a classification scheme for geometric programming and complementarity theorems††
- Programmes in Paired Spaces
- Solution Sets of Convex Programs Related to Chemical Equilibrium Problems
- Symmetric Duality for Generalized Unconstrained Geometric Programming
Cited in
(12)- Convex analysis treated by linear programming
- Strong duality and dual pricing properties in semi-infinite linear programming: a non-Fourier-Motzkin elimination approach
- Asymptotic kuhn-tucker conditions in abstract spaces
- Recent contributions to linear semi-infinite optimization: an update
- Zero duality gaps in infinite-dimensional programming
- On a compound duality classification for geometric programming
- Recent contributions to linear semi-infinite optimization
- On a classification scheme for geometric programming and complementarity theorems††
- Projection: A unified approach to semi-infinite linear programs and duality in convex programming
- Extending the mixed algebraic-analysis Fourier-Motzkin elimination method for classifying linear semi-infinite programmes
- An infeasible interior-point algorithm for solving primal and dual geometric programs
- OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS
This page was built for publication: Classifying convex extremum problems over linear topologies having separation properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1844591)
