On necessary conditions for a class of nondifferentiable minimax fractional programming
From MaRDI portal
Publication:2480919
DOI10.1016/j.cam.2007.03.032zbMath1350.90037OpenAlexW2035312465MaRDI QIDQ2480919
Publication date: 7 April 2008
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2007.03.032
Related Items (2)
Numerical solution of fraction Bagley-Torvik boundary value problem based on Chebyshev collocation method ⋮ Necessary optimality conditions for a class of nonsmooth vector optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On duality theorems for a nondifferentiable minimax fractional programming
- Optimality conditions for fractional minmax programming
- Saddle-point type optimality criteria for generalized fractional programming
- Necessary and sufficient conditions for minimax fractional programming
- A class of nondifferentiable mathematical programming problems
- Constraint qualifications in a class of nondifferentiable mathematical programming problems
- Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity
- Generalized Gradients and Applications
- State Constraints in Convex Control Problems of Bolza
This page was built for publication: On necessary conditions for a class of nondifferentiable minimax fractional programming