Simplex-Like Trajectories on Quasi-Polyhedral Sets

DOI10.1287/moor.26.1.147.10595zbMath1073.90527OpenAlexW1997287370MaRDI QIDQ2757674

Marco A. López, Edward J. Anderson, Miguel Angel Goberna

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.26.1.147.10595

zbMATH Keywords

Semi-infinite programming, simplex-like algorithms, locally polyhedral systems, quasi-polyhedral sets

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Related Items

Generalized corner optimal solution for LSIP: existence and numerical computation ⋮ Local conicity and polyhedrality of convex sets ⋮ Recent contributions to linear semi-infinite optimization ⋮ Linear representations and quasipolyhedrality of a finite-valued convex function ⋮ Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality ⋮ Marco A. López, a pioneer of continuous optimization in Spain ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ On local coincidence of a convex set and its tangent cone ⋮ Selected applications of linear semi-infinite systems theory ⋮ Linear semi-infinite programming theory: an updated survey ⋮ Directional end of a convex set: theory and applications.

This page was built for publication: Simplex-Like Trajectories on Quasi-Polyhedral Sets