Solving Optimization Problems over the Weakly Efficient Set

DOI10.1080/01630563.2020.1871009zbMath1465.90080OpenAlexW3125902366MaRDI QIDQ4985181

Javad Sadeghi, Hossein Mohebi

Publication date: 22 April 2021

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2020.1871009

zbMATH Keywords

multiobjective programmingnonconvex programmingnonlinear programminggeneralized cutting plane methodweak-efficiency

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
• Stochastic optimization over a Pareto set associated with a stochastic multi-objective optimization problem
• Minimization of a quasi-concave function over an efficient set
• Theory of multiobjective optimization
• Careful usage of pessimistic values is needed in multiple objectives optimization
• An algorithm for optimizing over the weakly-efficient set
• Computational experience concerning payoff tables and minimum criterion values over the efficient set
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• Nonlinear multiobjective optimization
• Utility function programs and optimization over the efficient set in multiple-objective decision making
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Simplicially-constrained DC optimization over efficient and weakly efficient sets
• Computational aspects of optimization problems over the efficient set
• Characterizing the efficient points without closedness or free-disposability
• Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case
• Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set
• Numerical solution for optimization over the efficient set by d.c. optimization algorithms
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• Algorithms for the vector maximization problem
• Multicriteria Optimization
• Convex analysis and monotone operator theory in Hilbert spaces
• Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
• Abstract convexity and global optimization
• An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set

This page was built for publication: Solving Optimization Problems over the Weakly Efficient Set