Proper efficiency and generalized nonconvex duality for vector minimization problems
From MaRDI portal
Publication:1393011
DOI10.1007/BF03398514zbMath0904.90149OpenAlexW2775352921MaRDI QIDQ1393011
Publication date: 27 January 1999
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03398514
Cites Work
- Unnamed Item
- Multiobjective duality with invexity
- A note on invex functions and duality in multiple objective optimization
- Strong convexity of sets and functions
- On efficiency and duality for multiobjective programs
- Second- and higher-order duality in nonlinear programming
- Proper efficiency and the theory of vector maximization
- Strong and Weak Convexity of Sets and Functions
- Proper Efficiency and Multiobjective Duality in Nonlinear Programming
- Generalised convexity and duality in multiple objective programming
- Further Generalizations of Convexity in Mathematical Programming
- Duality in nonconvex vector minimum problems