Combination between global and local methods for solving an optimization problem over the efficient set
type: Item
instance of: scholarly article
title: Combination between global and local methods for solving an optimization problem over the efficient set
zbMATH Open document ID: 1082.90563
DOI: 10.1016/S0377-2217(01)00301-0
author: Le Thi Hoai An
author: Pham Dinh Tao
author: Nguyen Van Thoai
published in: European Journal of Operational Research
publication date: 2002-11-20T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1832931
zbMATH Keywords: Global optimization
zbMATH Keywords: Multiple objective optimization
zbMATH Keywords: Optimization over efficient sets
zbMATH Keywords: D.c. programming
zbMATH Keywords: Branch and bound
MaRDI profile type: Publication
cites work: Optimization over the efficient set
cites work: An all-linear programming relaxation algorithm for optimizing over the efficient set
cites work: A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
cites work: Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
cites work: Minimization of a quasi-concave function over an efficient set
cites work: On the continuity of the minimum set of a continuous function
cites work: Introduction to sensitivity and stability analysis in nonlinear programming
cites work: Utility function programs and optimization over the efficient set in multiple-objective decision making
cites work: Maximizing a concave function over the efficient or weakly-efficient set
cites work: Introduction to global optimization
cites work: Q5650526
cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
cites work: Numerical solution for optimization over the efficient set by d.c. optimization algorithms
cites work: A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications
cites work: Algorithms for the vector maximization problem
cites work: Q5638112
cites work: Q3818808
cites work: Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
cites work: A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
cites work: Conical algorithm in global optimization for optimizing over efficient sets
cites work: Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
full work available at URL: s0377-2217(01)00301-0
OpenAlex ID: W2012420075
description: scientific article; zbMATH DE number 1832931