Representacion finita de sistemas de infinitas inecuaciones
From MaRDI portal
Publication:3666582
DOI10.1007/BF02888700zbMath0517.90043OpenAlexW1998452284MaRDI QIDQ3666582
Marco A. López, Jesus T. Pastor, Miguel Angel Goberna
Publication date: 1982
Published in: Trabajos de Estadistica y de Investigacion Operativa (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02888700
Numerical mathematical programming methods (65K05) Linear programming (90C05) Linear inequalities of matrices (15A39) Semi-infinite programming (90C34)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing a perfect duality in infinite programming
- Finding all vertices of a convex polyhedron
- DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
- On the intersections of cones and subspaces
- On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
This page was built for publication: Representacion finita de sistemas de infinitas inecuaciones