On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
From MaRDI portal
Publication:5556184
DOI10.1002/nav.3800160104zbMath0169.22201OpenAlexW1523693682MaRDI QIDQ5556184
A. Charnes, William W. Cooper, Kenneth O. Kortanek
Publication date: 1969
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800160104
Related Items
Objective function bounds for the inexact linear programming problem with generalized cost coefficients, Boundedness relations in linear semi-infinite programming, A theory of linear inequality systems, Frameworks and results in distributionally robust optimization, Linear inequalities in mathematical programming and pattern recognition, Semi-infinite programming, Geometric fundamentals of the simplex method in semi-infinite programming, Recent contributions to linear semi-infinite optimization, Farkas-Minkowski systems in semi-infinite programming, Foundations of operations research: from linear programming to data envelopment analysis, Implicit optimality criterion for convex SIP problem with box constrained index set, Recent contributions to linear semi-infinite optimization: an update, Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem, Optimality conditions for nondifferentiable convex semi-infinite programming, Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity, Stability theorems for infinitely constrained mathematical programs, Numerical treatment of a class of semi‐infinite programming problems, Theorems on the dimensions of convex sets, Separably-infinite programs, Inexact linear programming with generalized resource sets, Contributions of Professor William W. Cooper in operations research and management science, Duality gaps in semi-infinite linear programming—an approximation problem, Optimality conditions for convex semi-infinite programming problems, A note about linear inequality systems and duality, Duality models for multiobjective semiinfinite fractional programming problems involving type-I and related functions, On Haar's dual problem, Representacion finita de sistemas de infinitas inecuaciones, Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity, Convex semi-infinite games, On a cost allocation problem arising from a capacitated concentrator covering problem
Cites Work
- Unnamed Item
- Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
- Systems of Inequalities Involving Convex Functions
- Constraint qualifications in maximization problems
- An Infinite Linear Program with a Duality Gap
- On Representations of Semi-Infinite Programs which Have No Duality Gaps
- Semi-infinite programming, differentiability and geometric programming: Part II
- THE STRONG MINKOWSKI FARKAS-WEYL THEOREM FOR VECTOR SPACES OVER ORDERED FIELDS
