Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity
From MaRDI portal
Publication:5157459
DOI10.2298/FIL1709557AzbMath1488.90197OpenAlexW1486761424MaRDI QIDQ5157459
Publication date: 18 October 2021
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/fil1709557a
saddle point\((\Phi,\rho)\)-invex functionsemi-infinite minimax fractional programmingvector-valued Lagrange function
Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Fractional programming (90C32) Semi-infinite programming (90C34)
Related Items
Mixed Lagrange function in minimax fractional programming problems, On a modified optimal control problem with first-order PDE constraints and the associated saddle-point optimality criterion, Criteria of saddle points for the general form of vector optimization problem in complex space
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Duality in nondifferentiable minimax fractional programming with \(B-(p, r)\)-invexity
- Kinds of vector invex
- An algorithm for generalized fractional programs
- \(r\)-preinvexity and \(r\)-invexity in mathematical programming
- Semi-infinite programming
- New optimality conditions and duality results of \(G\) type in differentiable mathematical 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 for fractional minmax programming
- Generalized fractional programming duality: A parametric approach
- Multiobjective duality with invexity
- On sufficiency of the Kuhn-Tucker conditions
- On efficiency and duality for multiobjective programs
- Necessary conditions and sufficient conditions for static minmax problems
- On minimax fractional optimality conditions with invexity
- On minimax fractional optimality conditions with \((F,\rho)\)-convexity
- Generalized semi-infinite optimization: A first order optimality condition and examples
- First-order optimality conditions in generalized semi-infinite programming
- Sufficiency and duality in multiobjective programming involving generalized \(F\)-convex functions
- A class of \(B\)-(\(p\),\(r\))-invex functions and mathematical programming.
- On sufficiency and duality for \((b,F,\rho)\)-convex multiobjective programs
- On minimax fractional optimality and duality with generalized convexity
- Generalized semi-infinite programming: Theory and methods
- Minimax programming under \((p,r)\)-invexity
- Optimality conditions and duality for a minimax fractional programming with generalized convexity
- Optimality conditions and duality for arcwise semi-finite programming with parametric inequality constraints
- Wolfe-type duality involving \((B,\eta)\)-index functions for a minimax programming problem
- On saddle points in nonconvex semi-infinite programming
- On minimax fractional programming problems involving generalized \((H_p,r)\)-invex functions
- A Semi-Infinite Programming Model In Data Envelopment Analysis
- First-Order Optimality Conditions for Degenerate Index Sets in Generalized Semi-Infinite Optimization
- Strong and Weak Convexity of Sets and Functions
- 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
- What is invexity?
- Optimality conditions for convex semi-infinite programming problems
- Further Generalizations of Convexity in Mathematical Programming
- Minimax fractional programming involving generalised invex functions
- Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity
- Sufficiency and Duality in Multiobjective Programming with Generalized (F, ρ)-Convexity
- 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
- Semi-infinite programming. Recent advances
