Optimality conditions for convex semi-infinite programming problems

DOI10.1002/nav.3800270307zbMath0448.90045OpenAlexW2066822737MaRDI QIDQ3895233

Aharon Ben-Tal, Sanjo Zlobec, L. Kerzner

Publication date: 1980

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800270307

zbMATH Keywords

optimality conditionsconvex semi-infinite programming

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (14)

On optimality in abstract convex programming ⋮ Study of a special nonlinear problem arising in convex semi-infinite programming ⋮ Optimality theory for semi-infinite linear programming^∗ ⋮ Implicit optimality criterion for convex SIP problem with box constrained index set ⋮ An optimality test for semi-infinite linear programming ⋮ Unnamed Item ⋮ Method of reduction in convex programming ⋮ Optimality conditions for nondifferentiable convex semi-infinite programming ⋮ Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity ⋮ On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets ⋮ Optimality criteria without constraint qualifications for linear semidefinite problems ⋮ Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices ⋮ Geometry of optimality conditions and constraint qualifications: The convex case ⋮ Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity

Cites Work

• Unnamed Item
• Characterization theorems for constrained approximation problems via optimization theory
• 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: Optimality conditions for convex semi-infinite programming problems