Classifying convex extremum problems over linear topologies having separation properties
From MaRDI portal
Publication:1844591
DOI10.1016/0022-247X(74)90270-4zbMATH Open0283.90043MaRDI QIDQ1844591FDOQ1844591
Publication date: 1974
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Cites Work
- Duality and stability in extremum problems involving convex functions
- Programmes in Paired Spaces
- Convex analysis treated by linear programming
- Asymptotic duality over closed convex sets
- Erratum: Asymptotic duality over closed convex sets
- Asymptotic cones and duality of linear relations
- Linear programs in topological vector spaces
- Linear Programming in Reflexive Spaces
- Nonconvex Linear Topologies with the Hahn Banach Extension Property
- Symmetric Duality for Generalized Unconstrained Geometric Programming
- On Refinements of Some Duality Theorems in Linear Programming over Cones
- On a classification scheme for geometric programming and complementarity theorems††
- A note on duality gaps in linear programming over convex sets
- Non-Chebyshevian Moment Problems
- Classification Schemes for the Strong Duality of Linear Programming Over Cones
- Solution Sets of Convex Programs Related to Chemical Equilibrium Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (12)
- Asymptotic kuhn-tucker conditions in abstract spaces
- Extending the mixed algebraic-analysis Fourier–Motzkin elimination method for classifying linear semi-infinite programmes
- Zero duality gaps in infinite-dimensional programming
- OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS
- On a classification scheme for geometric programming and complementarity theorems††
- An infeasible interior-point algorithm for solving primal and dual geometric programs
- Convex analysis treated by linear programming
- Recent contributions to linear semi-infinite optimization
- Strong duality and dual pricing properties in semi-infinite linear programming: a non-Fourier-Motzkin elimination approach
- Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming
- On a compound duality classification for geometric programming
- Recent contributions to linear semi-infinite optimization: an update
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)
