Necessary conditions for nonlinear suboptimization over the weakly- efficient set

DOI10.1007/BF00939883zbMath0794.90049MaRDI QIDQ1321391

S. Bolintineanu

Publication date: 27 April 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

sensitivitystabilityglobal optimizationnonconvex programmingsuboptimal solutionnecessary first-order conditionsnonlinear multiobjective programweakly-efficient set

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)

Related Items

Semivectorial bilevel optimization problem: penalty approach ⋮ Optimization over the efficient set of multi-objective convex optimal control problems ⋮ Semivectorial bilevel optimization on Riemannian manifolds ⋮ The well-posedness for multiobjective generalized games ⋮ Stochastic optimization over a Pareto set associated with a stochastic multi-objective optimization problem ⋮ Minimization of a quasi-concave function over an efficient set ⋮ Optimization over the efficient set ⋮ Optimality Conditions for Semivectorial Bilevel Convex Optimal Control Problems ⋮ Post-Pareto analysis and a new algorithm for the optimal parameter tuning of the elastic net ⋮ Semivectorial bilevel programming versus scalar bilevel programming ⋮ Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case ⋮ Second-order efficiency conditions and sensitivity of efficient points ⋮ Characterization of efficient solutions of multi-objective \(E\)-convex programming problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case

Cites Work

• Unnamed Item
• Unnamed Item
• Minimization of a quasi-concave function over an efficient set
• Introduction to sensitivity and stability analysis in nonlinear programming
• A survey of vector optimization in infinite-dimensional spaces. II
• An algorithm for optimizing over the weakly-efficient set
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• An all-linear programming relaxation algorithm for optimizing over the efficient set
• A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
• Optimization over the efficient set using an active constraint approach
• Solution point differentiability without strict complementarity in nonlinear programming
• Algorithms for the vector maximization problem
• Optimization over the efficient set

This page was built for publication: Necessary conditions for nonlinear suboptimization over the weakly- efficient set