Another approach to multiobjective programming problems with \(F\)-convex functions
From MaRDI portal
Publication:1767396
DOI10.1007/BF02936063zbMath1138.90474OpenAlexW2132893468MaRDI QIDQ1767396
Publication date: 10 March 2005
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02936063
Cites Work
- Unnamed Item
- Unnamed Item
- On sufficiency of the Kuhn-Tucker conditions
- Necessary conditions for optimality of nondifferentiable convex multiobjective programming
- On efficiency and duality for multiobjective programs
- Duality theory in multiobjective programming
- On generalized convex functions in optimization theory -- a survey
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Efficiency conditions and duality for a class of multiobjective fractional programming problems
- A characterization of weakly efficient points
- Proper efficiency and the theory of vector maximization
- Some results on dual vector optimization problems
- On duality for weakly minimized vector valued optimization problems
- Generalised convexity and duality in multiple objective programming
- Further Generalizations of Convexity in Mathematical Programming
- Duality for Multiple Objective Convex Programs
- A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions]
- Various types of nonsmooth invex functions
- Proper efficiency conditions and duality for multiobjective programming problems involving semilocally invex functions
This page was built for publication: Another approach to multiobjective programming problems with \(F\)-convex functions
