On nonsmooth multiobjective programming with generalized univexity
From MaRDI portal
Publication:5446282
DOI10.1080/09720502.2007.10700525zbMATH Open1137.90655OpenAlexW2026443752MaRDI QIDQ5446282FDOQ5446282
Authors:
Publication date: 6 March 2008
Published in: Journal of Interdisciplinary Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720502.2007.10700525
Recommendations
- Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions
- Sufficiency and duality in nonsmooth multiobjective programming problem under generalized univex functions
- Nonsmooth multiobjective optimization involving generalized univex functions
- Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized \((F,\alpha ,\rho ,\theta)\)-d-V-univex functions
- Generalized univex functions in nonsmooth multiobjective optimization
Cites Work
- Optimality criteria in mathematical programming involving generalized invexity
- On sufficiency of the Kuhn-Tucker conditions
- On multiple-objective optimization with generalized univexity
- Optimality and duality with generalized convexity
- Proper efficiency and the theory of vector maximization
- Necessary and sufficient conditions in constrained optimization
- Optimality criteria and duality in multiple-objective optimization involving generalized invexity
- Nonsmooth multiobjective programming
- Sulle stratificazioni convesse
- Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space
- Lipschitz B-vex functions and nonsmooth programming
- Duality for a non-differentiable programming problem
Cited In (7)
- Nonsmooth multiobjective optimization involving generalized univex functions
- Sufficiency and duality in nonsmooth multiobjective programming problem under generalized univex functions
- Efficiency and duality in nonsmooth multiobjective programming with \((F,\alpha,\rho,\theta)\)-\(d\)-\(V\)-univexity
- Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions
- On sufficiency and duration in nonsmooth multiobjective programming.
- Nondifferentiable multiobjective programming under generalized \(d\)-univexity
- Title not available (Why is that?)
This page was built for publication: On nonsmooth multiobjective programming with generalized univexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5446282)
