Optimality conditions for fractional minmax programming
From MaRDI portal
Necessary and sufficient conditions are given for the existence of an optimal solution to the fractional minmax programming problem Minimize \(F(x)=\sup_{y\in Y}(f(x,y)+(x^ tBx)^{1/2})/h(x,y)\) subject to g(x)\(\leq 0\), where Y is a compact subset of \(R^ m\), f, g and h are differentiable functions, and \(h(x,y)>0\) for all feasible x, y.
Recommendations
- Necessary and sufficient conditions for minimax fractional programming
- Optimality conditions for a class of min-max semi-infinite fractional programming
- Optimality conditions for set-valued minimax fractional programming problems
- Optimality conditions and duality for a minimax fractional programming with generalized convexity
- Sufficient efficiency conditions for a minimizing fractional program
- On minimax fractional optimality conditions with \((F,\rho)\)-convexity
- Optimality conditions for nondifferentiable minimax fractional programming with complex variables
- On minimax fractional optimality conditions with invexity
- Minmax fractional programming problem involving generalized convex functions
- Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity
Cites work
Cited in
(24)- Necessary optimality conditions for a class of nonsmooth vector optimization
- A class of multiple-criteria fractional programming problems
- Saddle-point type optimality criteria for generalized fractional programming
- On minimax fractional optimality conditions with \((F,\rho)\)-convexity
- Necessary and sufficient conditions for minimax fractional programming
- Constraint qualifications in a class of nondifferentiable mathematical programming problems
- Generalized fractional programming: Optimality and duality theory
- Optimality conditions and duality for a minimax fractional programming with generalized convexity
- The maximax minimax quotient theorem
- Optimality conditions for nondifferentiable minimax fractional programming with complex variables
- Constraint qualification in a general class of Lipschitzian mathematical programming problems
- Constraint qualification in a general class of nondifferentiable mathematical programming problems
- On necessary conditions for a class of nondifferentiable minimax fractional programming
- Optimality conditions for a class of nondifferentiable minmax programming problems
- Multiobjective fractional programming duality theory
- scientific article; zbMATH DE number 96517 (Why is no real title available?)
- A solvability theorem and minimax fractional programming
- A Fourth bibliography of fractional programming
- Mixed duality without a constraint qualification for minimax fractional programming
- Optimality conditions and duality models for a class of nonsmooth constrained fractional variational problems
- Mixed Lagrange function in minimax fractional programming problems
- Saddle point criteria in semi-infinite minimax fractional programming under \((\Phi,\rho)\)-invexity
- Continuous-time fractional minmax programming
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
This page was built for publication: Optimality conditions for fractional minmax programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1061017)
