Geometric fundamentals of the simplex method in semi-infinite programming
From MaRDI portal
Publication:1117839
DOI10.1007/BF01740508zbMath0667.90066MaRDI QIDQ1117839
Miguel Angel Goberna, Valentín Jornet
Publication date: 1988
Published in: OR Spektrum (Search for Journal in Brave)
Related Items (9)
Generalized corner optimal solution for LSIP: existence and numerical computation ⋮ Inverse optimization in semi-infinite linear programs ⋮ Caracterizacion algebraica de las aristas infinitas en el conjunto dual factible de un psi-lineal ⋮ On the numerical treatment of linearly constrained semi-infinite optimization problems ⋮ Quasipolyhedral sets in linear semiinfinite inequality systems ⋮ A purification algorithm for semi-infinite programming ⋮ Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation ⋮ On Haar's dual problem ⋮ Linear semi-infinite programming theory: an updated survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
- Boundedness relations in linear semi-infinite programming
- Semi-infinite quadratic programming
- Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
- On constraint sets of infinite linear programs over ordered fields
- An implementation of a discretization method for semi-infinite programming
- Duality gaps in semi-infinite linear programming—an approximation problem
- On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
- On the Computational Solution of a Class of Generalized Moment Problems
This page was built for publication: Geometric fundamentals of the simplex method in semi-infinite programming
