Directional end of a convex set: theory and applications.

DOI10.1023/A:1017583514580zbMath1041.90058OpenAlexW1561280018MaRDI QIDQ1608146

Valentín Jornet, Margarita M. L. Rodríguez, Miguel Angel Goberna

Publication date: 12 August 2002

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1017583514580

zbMATH Keywords

linear systemsconvex setsilluminationsemi-infinite programmingvisibility

Mathematics Subject Classification ID

Semi-infinite programming (90C34) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some characterizations of convex polyhedra
• Étude geométrique des espaces vectoriels II: Polyedres et polytopes convexes
• Combinatorial problems on the illumination of convex bodies
• Locally Farkas-Minkowski linear inequality systems
• Locally polyhedral linear inequality systems
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• Simplex-Like Trajectories on Quasi-Polyhedral Sets
• A Lipschitzian Characterization of Convex Polyhedra
• Convex Analysis