Duality for nondifferentiable minimax fractional programming problem involving higher order \((C,\alpha, \rho, d)\)-convexity
DOI10.1007/s12597-016-0295-0zbMath1397.90395OpenAlexW2570928943MaRDI QIDQ1788859
Krishna Kummari, Anurag Jayswal, Vivek Kumar Singh
Publication date: 9 October 2018
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-016-0295-0
nondifferentiable programminghigher-order dualityhigher-order (\(C, \alpha , \rho , d\))-convexityminimax fractional programming problem
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)
Related Items (1)
Cites Work
- Unnamed Item
- Higher-order symmetric duality in multiobjective programming problems
- Parametric duality models for semiinfinite multiobjective fractional programming problems containing generalized \((\alpha, \eta, \rho)\)-V-invex functions
- Duality in nondifferentiable minimax fractional programming with \(B-(p, r)\)-invexity
- Higher-order symmetric duality for a class of multiobjective fractional programming problems
- Second-order duality for a nondifferentiable minimax fractional programming under generalized \(\alpha\)-univexity
- Higher-order duality in nondifferentiable minimax fractional programming involving generalized convexity
- Optimality and duality for nondifferentiable minimax fractional programming with generalized convexity
- On second order duality of minimax fractional programming with square root term involving generalized \(B\)-\((p,r)\)-invex functions
- On duality theorems for a nondifferentiable minimax fractional programming
- Higher-order nondifferentiable symmetric duality with generalized \(F\)-convexity
- Global parametric sufficient optimality conditions for semi-infinite discrete minmax fractional programming problems involving generalized \((\eta ,\rho )\)-invex functions
- On efficiency and duality for multiobjective programs
- Necessary and sufficient conditions for minimax fractional programming
- Higher-order duality for multiobjective programming problems involving \({(F, \alpha, \rho, d)}\)-V-type I functions
- On second-order duality for nondifferentiable minimax fractional programming
- Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity
- Duality in nondifferentiable minimax fractional programming with generalized convexity
- On second-order duality for a class of nondifferentiable minimax fractional programming problem with \((C,\alpha,\rho,d)\)-convexity
- Strong and Weak Convexity of Sets and Functions
- Further Generalizations of Convexity in Mathematical Programming
- Second order nondifferentiable minimax fractional programming with square root terms
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
This page was built for publication: Duality for nondifferentiable minimax fractional programming problem involving higher order \((C,\alpha, \rho, d)\)-convexity
