Combination between global and local methods for solving an optimization problem over the efficient set

European Journal of Operational Research

Volumn 142, Issue 2, 2002, Pages 258-270

  Le Thi, Hoai An ^a   Pham, Dinh Tao ^a   Thoai, Nguyen V ^b  

^a Avenue de l Université 76801 Saint Etienne du Rouvray   (France)

^b UNIVERSITY OF TRIER   (Germany)

Author keywords

Branch and bound; D.c. programming; Global optimization; Multiple objective optimization; Optimization over efficient sets

Indexed keywords

ALGORITHMS; GLOBAL OPTIMIZATION; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING; SET THEORY;

MULTIPLE OBJECTIVE OPTIMIZATION;

OPERATIONS RESEARCH;

EID: 0037120697     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00301-0     Document Type: Conference Paper

References (27)

1. Optimization over the efficient set
2. An all-linear programming relaxation algorithm for optimizing over the efficient set
3. A finite, nonadjacent extreme-point search algorithm for optimizing over the efficient set
4. Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
5. Minimization of a quasiconcave function over an efficient set
6. On the continuity of the minimum set of a continuous function
7. Optimization over the efficient set
8. Utility function programs and optimization over the efficient set in multiple-objective decision making
9. Maximizing a concave function over the efficient or weakly-efficient set
10. Contribution à l'optimisation non convexe et l'optimisation globale
11. Solving a class of linearly constrained indefinite quadratic problems by D.c. algorithms
12. Numerical solution for optimization over the efficient set by D.C. optimization algorithms
13. Algorithms for solving a class of non convex optimization problems
14. Duality in D.C. (difference of convex functions) optimization
15. A D.c. optimization algorithm for solving the trust-region subproblem
16. Convex analysis approach to d.c. programming: Theory, algorithm and applications (dedicated to professor Hoang Tuy on the occasion of his 70th birthday)
17. Algorithms for the vector maximization problem
18. On convergence and application of a decomposition method using duality bounds for nonconvex optimization
19. A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
20. Conical algorithm in global optimization for optimizing over efficient sets