Pages that link to "Item:Q5556184"

The following pages link to On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions (Q5556184):

Displaying 30 items.

• Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem (Q494875) (← links)
• Semi-infinite programming (Q869581) (← links)
• Contributions of Professor William W. Cooper in operations research and management science (Q1011250) (← links)
• Convex semi-infinite games (Q1065725) (← links)
• Objective function bounds for the inexact linear programming problem with generalized cost coefficients (Q1085061) (← links)
• Boundedness relations in linear semi-infinite programming (Q1097166) (← links)
• A theory of linear inequality systems (Q1103695) (← links)
• Linear inequalities in mathematical programming and pattern recognition (Q1117138) (← links)
• Geometric fundamentals of the simplex method in semi-infinite programming (Q1117839) (← links)
• Farkas-Minkowski systems in semi-infinite programming (Q1142158) (← links)
• Stability theorems for infinitely constrained mathematical programs (Q1211417) (← links)
• Theorems on the dimensions of convex sets (Q1221941) (← links)
• Inexact linear programming with generalized resource sets (Q1257413) (← links)
• On a cost allocation problem arising from a capacitated concentrator covering problem (Q1316101) (← links)
• Recent contributions to linear semi-infinite optimization (Q1680760) (← links)
• Recent contributions to linear semi-infinite optimization: an update (Q1730534) (← links)
• Implicit optimality criterion for convex SIP problem with box constrained index set (Q1939083) (← links)
• Frameworks and results in distributionally robust optimization (Q2165596) (← links)
• On Haar's dual problem (Q2564337) (← links)
• Optimality conditions for nondifferentiable convex semi-infinite programming (Q3308655) (← links)
• Representacion finita de sistemas de infinitas inecuaciones (Q3666582) (← links)
• Separably-infinite programs (Q3863689) (← links)
• Duality gaps in semi-infinite linear programming—an approximation problem (Q3895225) (← links)
• Optimality conditions for convex semi-infinite programming problems (Q3895233) (← links)
• A note about linear inequality systems and duality (Q4726050) (← links)
• Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity (Q5157459) (← links)
• Numerical treatment of a class of semi‐infinite programming problems (Q5181566) (← links)
• Duality models for multiobjective semiinfinite fractional programming problems involving type-I and related functions (Q5243389) (← links)
• Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (<i>p</i>,<i>r</i>)-Invexity (Q5251572) (← links)
• Foundations of operations research: from linear programming to data envelopment analysis (Q6106760) (← links)