Locally Farkas-Minkowski linear inequality systems

DOI10.1007/BF02564714zbMath0936.15012OpenAlexW1994483650MaRDI QIDQ1304777

Rubén Puente, Virginia N. Vera de Serio

Publication date: 14 May 2000

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02564714

zbMATH Keywords

linear programmingKarush-Kuhn-Tucker conditionFarkas-Minkowski systemHaar dual problemlocally polyhedral system

Mathematics Subject Classification ID

Linear programming (90C05) Linear inequalities of matrices (15A39)

Related Items (22)

Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ Constraint qualifications in convex vector semi-infinite optimization ⋮ Local conicity and polyhedrality of convex sets ⋮ Semi-infinite programming ⋮ Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization ⋮ Recent contributions to linear semi-infinite optimization ⋮ Linear representations and quasipolyhedrality of a finite-valued convex function ⋮ Saturation in linear optimization ⋮ Locally Farkas-Minkowski systems in convex semi-infinite programming ⋮ Representability of convex sets by analytical linear inequality systems. ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ Isolated efficiency in nonsmooth semi-infinite multi-objective programming ⋮ Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities ⋮ Necessary optimality conditions for nonsmooth semi-infinite programming problems ⋮ New Farkas-type constraint qualifications in convex infinite programming ⋮ Selected applications of linear semi-infinite systems theory ⋮ Asymptotic optimality conditions for linear semi-infinite programming ⋮ Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Nonsmooth semi-infinite programming problems with mixed constraints ⋮ Some results about the facial geometry of convex semi-infinite systems ⋮ Linear semi-infinite programming theory: an updated survey ⋮ Directional end of a convex set: theory and applications.

Cites Work

• Unnamed Item
• Quasipolyhedral sets in linear semiinfinite inequality systems
• Some characterizations of convex polyhedra
• A theory of linear inequality systems
• Locally polyhedral linear inequality systems
• On infinite systems of linear inequalities
• Semi-Infinite Programming: Theory, Methods, and Applications
• DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
• Optimality theory for semi-infinite linear programming^∗

This page was built for publication: Locally Farkas-Minkowski linear inequality systems