Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity
From MaRDI portal
Publication:5251572
DOI10.1080/01630563.2014.884584zbMath1346.90782OpenAlexW2087675241MaRDI QIDQ5251572
Publication date: 20 May 2015
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2014.884584
saddle pointLagrange functions\((p,r)\)-invex functionsemi-infinite minimax fractional programming problem
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Fractional programming (90C32) Semi-infinite programming (90C34)
Related Items (7)
Saddle point criteria in nonsmooth semi-infinite minimax fractional programming problems ⋮ Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data ⋮ Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data ⋮ Approximate optimal solutions for multiobjective optimization problems with infinite constraints ⋮ Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity ⋮ On Minimax Fractional Semi-Infinite Programming Problems with Applications ⋮ Optimality and duality for nonsmooth minimax programming problems using convexifactor
Cites Work
- Duality for optimization problems in Banach algebras
- Optimality and invexity in optimization problems in Banach algebras (spaces)
- \(r\)-preinvexity and \(r\)-invexity in mathematical programming
- Semi-infinite programming
- First order optimality conditions for generalized semi-infinite programming problems
- Augmented lagrangians in semi-infinite programming
- Generalized fractional minimax programming with \(B-(p,r)\)-invexity
- Global parametric sufficient optimality conditions for semi-infinite discrete minmax fractional programming problems involving generalized \((\eta ,\rho )\)-invex functions
- Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions
- On sufficiency of the Kuhn-Tucker conditions
- Generalized semi-infinite optimization: A first order optimality condition and examples
- First-order optimality conditions in generalized semi-infinite programming
- \((p,r)\)-invexity in multiobjective programming.
- Generalized semi-infinite programming: Theory and methods
- Minimax programming under \((p,r)\)-invexity
- Optimality conditions and duality for arcwise semi-finite programming with parametric inequality constraints
- On saddle points in nonconvex semi-infinite programming
- Minimax programming under generalized \((p, r)\)-invexity
- A Semi-Infinite Programming Model In Data Envelopment Analysis
- First-Order Optimality Conditions for Degenerate Index Sets in Generalized Semi-Infinite Optimization
- Semi-Infinite Programming: Theory, Methods, and Applications
- Optimality conditions for nondifferentiable convex semi-infinite programming
- Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions
- Optimality conditions for convex semi-infinite programming problems
- On Nonlinear Fractional Programming
- On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
- A dual parametrization method for convex semi-infinite programming
- \((p,r)\)-invex sets and functions
- On \((p,r)\)-invexity-type nonlinear programming problems.
This page was built for publication: Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity
