Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions
From MaRDI portal
Publication:1041446
DOI10.1007/s10898-009-9400-8zbMath1187.90302MaRDI QIDQ1041446
Publication date: 2 December 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-009-9400-8
90C46: Optimality conditions and duality in mathematical programming
90C34: Semi-infinite programming
26B25: Convexity of real functions of several variables, generalizations
Related Items
On some generalized convex functions under differentiability, Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity, Optimality conditions and duality on approximate solutions in vector optimization with arcwise connectivity, On saddle points in nonconvex semi-infinite programming, Optimality conditions and duality for arcwise connected interval optimization problems, Optimality conditions and duality for nonsmooth vector equilibrium problems with constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limiting Lagrangians: A primal approach
- Generalized arcwise-connected functions and characterizations of local- global minimum properties
- Optimality conditions and duality involving arcwise connected and generalized arcwise connected functions
- Optimality and duality for minmax problems involving arcwise connected and generalized arcwise connected functions
- On duality in semi-infinite programming and existence theorems for linear inequalities
- First-order optimality conditions in generalized semi-infinite programming
- B-vex functions
- Optimality conditions and duality for arcwise semi-finite programming with parametric inequality constraints
- Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
- Semi-Infinite Programming: Theory, Methods, and Applications
- Uniform duality in semi-infinite convex optimization
- Optimality conditions for nondifferentiable convex semi-infinite programming
- Duality gaps in semi-infinite linear programming—an approximation problem
- Direct theorems in semi-infinite convex programming
- Optimality conditions and duality for fractional programming problems involving arcwise connected functions and their generalizations
