Pages that link to "Item:Q3895233"
From MaRDI portal
The following pages link to Optimality conditions for convex semi-infinite programming problems (Q3895233):
Displaying 13 items.
- Optimality criteria without constraint qualifications for linear semidefinite problems (Q690528) (← links)
- Study of a special nonlinear problem arising in convex semi-infinite programming (Q844519) (← links)
- Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices (Q987504) (← links)
- Method of reduction in convex programming (Q1169402) (← links)
- Implicit optimality criterion for convex SIP problem with box constrained index set (Q1939083) (← links)
- Optimality conditions for nondifferentiable convex semi-infinite programming (Q3308655) (← links)
- Geometry of optimality conditions and constraint qualifications: The convex case (Q3877415) (← links)
- On optimality in abstract convex programming (Q3968766) (← links)
- An optimality test for semi-infinite linear programming (Q4327961) (← links)
- Optimality theory for semi-infinite linear programming<sup>∗</sup> (Q4845183) (← links)
- Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity (Q5157459) (← links)
- Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (<i>p</i>,<i>r</i>)-Invexity (Q5251572) (← links)
- On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets (Q5413872) (← links)