Solving Optimization Problems over the Weakly Efficient Set

DOI10.1080/01630563.2020.1871009zbMATH Open1465.90080OpenAlexW3125902366MaRDI QIDQ4985181FDOQ4985181

Authors: J. Sadeghi, H. 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

Recommendations

• An algorithm for optimizing over the weakly-efficient set
• Applying set optimization to weak efficiency
• On minimization over weakly efficient sets
• Optimization over the efficient set
• Optimization over the efficient set
• An inner approximation method for optimization over the weakly efficient set
• An inner approximation method for optimization over the weakly efficient set
• Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency
• Optimization over the efficient set: overview
• Weak \(S\)-efficient solution of vector optimization

zbMATH Keywords

nonlinear programmingnonconvex programmingmultiobjective programminggeneralized cutting plane methodweak-efficiency

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (11)

• Applying set optimization to weak efficiency
• Generating the weakly efficient set of nonconvex multiobjective problems
• Strongly proper efficient solutions: efficient solutions with bounded trade-offs
• An inner approximation method for optimization over the weakly efficient set
• On minimization over weakly efficient sets
• Simplicially-constrained DC optimization over efficient and weakly efficient sets
• Optimization over the efficient set: overview
• An algorithm for optimizing over the weakly-efficient set
• An inner approximation method for optimization over the weakly efficient set
• Optimizing over the properly efficient set of convex multi-objective optimization problems
• Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective Problems

Uses Software

• Matlab

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4985181)