A reduced formulation for pseudoinvex vector functions
From MaRDI portal
Publication:1730436
DOI10.1007/s10479-016-2372-4zbMath1409.90164OpenAlexW2553096496MaRDI QIDQ1730436
Manuel Arana-Jiménez, Laura Carosi, Riccardo Cambini
Publication date: 6 March 2019
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11568/818584
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A critical view on invexity
- Canonical duality for solving general nonconvex constrained problems
- Kinds of vector invex
- Invexity and optimization
- Invex functions and generalized convexity in multiobjective programming
- Efficiency through variational-like inequalities with Lipschitz functions
- A characterization of pseudoinvexity in multiobjective programming
- What is invexity?
- A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions]
- ρ-Invex Functions and ( F , ρ)Convex Functions: Properties and Equivalences
- Some new classes of generalized concave vector-valued functions
- Generalized convexity in multiobjective programming
This page was built for publication: A reduced formulation for pseudoinvex vector functions