Efficiency and approachability of nonconvex bicriteria programs

DOI10.1006/jmaa.2001.7484zbMath1017.90097OpenAlexW2046620053MaRDI QIDQ5946936

Xue Xiang Huang, Xiao Qi Yang

Publication date: 21 February 2002

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.2001.7484

zbMATH Keywords

stabilityapproachabilitybicriteria optimizationmodified Lagrangians

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)

Related Items (1)

Efficiency in quasiconvex multiobjective nondifferentiable optimization on the real line

Cites Work

• Unnamed Item
• Theory of multiobjective optimization
• Exponential transformation in convexifying a noninferior frontier and exponential generating method
• Vector optimization and generalized Lagrangian duality
• Efficiency and solution approaches to bicriteria nonconvex programs
• A sufficient and necessary condition for nonconvex constrained optimization
• Zero duality gap for a class of nonconvex optimization problems
• Exact penalty functions and stability in locally Lipschitz programming
• The Vector Maximization Problem: Proper Efficiency and Stability
• Variational Analysis
• Decreasing Functions with Applications to Penalization
• Extended Lagrange And Penalty Functions in Continuous Optimization^*
• Convexification of a noninferior frontier
• Nonlinear Lagrangian theory for nonconvex optimization.

This page was built for publication: Efficiency and approachability of nonconvex bicriteria programs