On necessary conditions for a class of nondifferentiable minimax fractional programming
From MaRDI portal
Publication:2480919
DOI10.1016/J.CAM.2007.03.032zbMATH Open1350.90037OpenAlexW2035312465MaRDI QIDQ2480919FDOQ2480919
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
Recommendations
- Kuhn-Tucker type necessary optimality conditions for a class of nonsmooth minimax fractional programming
- scientific article; zbMATH DE number 5631029
- Necessary and sufficient conditions for minimax fractional programming
- Optimality conditions and duality for a class of nondifferentiable multiobjective generalized fractional programming problems
- Constraint qualification in a general class of nondifferentiable mathematical programming problems
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized Gradients and Applications
- State Constraints in Convex Control Problems of Bolza
- A class of nondifferentiable mathematical programming problems
- Necessary and sufficient conditions for minimax fractional programming
- On duality theorems for a nondifferentiable minimax fractional programming
- Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity
- Optimality conditions for fractional minmax programming
- Constraint qualifications in a class of nondifferentiable mathematical programming problems
- Saddle-point type optimality criteria for generalized fractional programming
Cited In (8)
- Kuhn-Tucker type necessary optimality conditions for a class of nonsmooth minimax fractional programming
- On nondifferentiable fractional minimax programming
- \(\varepsilon\)-optimality for minimax programming problems
- Constraint qualifications in a class of nondifferentiable mathematical programming problems
- Necessary optimality conditions for a class of nonsmooth vector optimization
- Title not available (Why is that?)
- Numerical solution of fraction Bagley-Torvik boundary value problem based on Chebyshev collocation method
- Optimality conditions for nondifferentiable minimax fractional programming with complex variables
This page was built for publication: On necessary conditions for a class of nondifferentiable minimax fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2480919)
