Saddle point criteria in semi-infinite minimax fractional programming under (,)-invexity
From MaRDI portal
(Redirected from Publication:5157459)
Saddle point criteria in semi-infinite minimax fractional programming under \((\Phi,\rho)\)-invexity
Saddle point criteria in semi-infinite minimax fractional programming under \((\Phi,\rho)\)-invexity
Recommendations
- Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity
- Saddle point condition of multiple-objective semi-infinite programming with generalized invex function
- Saddle point criteria in nonsmooth semi-infinite minimax fractional programming problems
- Saddle-point condition of a class of semi-infinite programming
- Saddle point criteria for semi-infinite programming problems via an -approximation method
Cites work
- \(r\)-preinvexity and \(r\)-invexity in mathematical programming
- A class of \(B\)-(\(p\),\(r\))-invex functions and mathematical programming.
- A dual parametrization method for convex semi-infinite programming
- A Semi-Infinite Programming Model In Data Envelopment Analysis
- An algorithm for generalized fractional programs
- Augmented lagrangians in semi-infinite programming
- Duality in nondifferentiable minimax fractional programming with \(B-(p, r)\)-invexity
- First order optimality conditions for generalized semi-infinite programming problems
- First-order optimality conditions for degenerate index sets in generalized semi-infinite optimi\-zation.
- First-order optimality conditions in generalized semi-infinite programming
- Further Generalizations of Convexity in Mathematical Programming
- Generalized \(({\mathcal F},\beta,\varphi,\rho,\theta)\)-univex functions and global parametric sufficient optimality conditions in semiinfinite discrete minmax fractional programming
- Generalized fractional minimax programming with \(B-(p,r)\)-invexity
- Generalized fractional programming duality: A parametric approach
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Generalized semi-infinite programming: Theory and methods
- Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions
- Global parametric sufficient optimality conditions for semi-infinite discrete minmax fractional programming problems involving generalized \((\eta ,\rho )\)-invex functions
- scientific article; zbMATH DE number 3870083 (Why is no real title available?)
- scientific article; zbMATH DE number 4055404 (Why is no real title available?)
- scientific article; zbMATH DE number 3694045 (Why is no real title available?)
- scientific article; zbMATH DE number 3755766 (Why is no real title available?)
- scientific article; zbMATH DE number 3791103 (Why is no real title available?)
- scientific article; zbMATH DE number 3593326 (Why is no real title available?)
- scientific article; zbMATH DE number 592621 (Why is no real title available?)
- Kinds of vector invex
- Mathematical programming with \((\Phi,\rho)\)-invexity
- Minimax fractional programming involving generalised invex functions
- Minimax programming under (p,r)-invexity
- Multiobjective duality with invexity
- Necessary conditions and sufficient conditions for static minmax problems
- New optimality conditions and duality results of \(G\) type in differentiable mathematical programming
- On efficiency and duality for multiobjective programs
- On minimax fractional optimality and duality with generalized convexity
- On minimax fractional optimality conditions with \((F,\rho)\)-convexity
- On minimax fractional optimality conditions with invexity
- On minimax fractional programming problems involving generalized \((H_p,r)\)-invex functions
- On saddle points in nonconvex semi-infinite programming
- On sufficiency and duality for (b,F,)-convex multiobjective programs
- On sufficiency of the Kuhn-Tucker conditions
- On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
- 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
- Optimality conditions for convex semi-infinite programming problems
- Optimality conditions for fractional minmax programming
- Optimality conditions for nondifferentiable convex semi-infinite programming
- Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity
- Semi-infinite programming
- Semi-infinite programming. Recent advances
- Semi-Infinite Programming: Theory, Methods, and Applications
- Strong and Weak Convexity of Sets and Functions
- Sufficiency and duality in multiobjective programming involving generalized \(F\)-convex functions
- Sufficiency and Duality in Multiobjective Programming with Generalized (F, ρ)-Convexity
- What is invexity?
- Wolfe-type duality involving \((B,\eta)\)-index functions for a minimax programming problem
Cited in
(11)- Saddle point criteria in nonsmooth semi-infinite minimax fractional programming problems
- Saddle point criteria for semi-infinite programming problems via an -approximation method
- Saddle point criteria in multiobjective fractional programming involving exponential invexity
- On a modified optimal control problem with first-order PDE constraints and the associated saddle-point optimality criterion
- scientific article; zbMATH DE number 5629782 (Why is no real title available?)
- Saddle point condition of multiple-objective semi-infinite programming with generalized invex function
- Mixed Lagrange function in minimax fractional programming problems
- Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints
- Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity
- Saddle-point condition of a class of semi-infinite programming
- Criteria of saddle points for the general form of vector optimization problem in complex space
This page was built for publication: Saddle point criteria in semi-infinite minimax fractional programming under \((\Phi,\rho)\)-invexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5157459)
