Conical Algorithm in Global Optimization for Optimizing over Efficient Sets

Authors:
Nguyen V. Thoai
Affiliations:
Department of Mathematics, University of Trier, 54286 Trier, Germany (e-mail: thoai@uni-trier.de)
Venue:
Journal of Global Optimization
Year:
2000

Citing 8
Cited 4

Concave minimization via conical partitions and polyhedral outer approximation

Mathematical Programming: Series A and B
Minimization of a quasi-concave function over an efficient set

Mathematical Programming: Series A and B
Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem

Journal of Optimization Theory and Applications
Utility function programs and optimization over the efficient set in multiple-objective decision making

Journal of Optimization Theory and Applications
DC programming: overview

Journal of Optimization Theory and Applications
Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem

Journal of Optimization Theory and Applications
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)

Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Numerical solution for optimization over the efficient set by d.c. optimization algorithms

Operations Research Letters

Convergence and application of a decomposition method using duality bounds for nonconvex global optimization

Journal of Optimization Theory and Applications
Optimization over the efficient set: overview

Journal of Global Optimization
An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem

Journal of Global Optimization
Criteria and dimension reduction of linear multiple criteria optimization problems

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of optimizing some contiuous function over the efficient set of a multiple objective programming problem can be formulated as a nonconvex global optimization problem with special structure. Based on the conical branch and bound algorithm in global optimization, we establish an algorithm for optimizing over efficient sets and discuss about the implementation of this algorithm for some interesting special cases including the case of biobjective programming problems.