Obtaining an outer approximation of the efficient set of nonlinear biobjective problems

Authors:
José Fernández;Boglárka Tóth
Affiliations:
Department of Statistics and Operations Research, University of Murcia, Murcia, Spain;Department of Statistics and Operations Research, University of Murcia, Murcia, Spain
Venue:
Journal of Global Optimization
Year:
2007

Citing 2
Cited 5

New computer methods for global optimization

New computer methods for global optimization
Empirical convergence speed of inclusion functions for facility location problems

Journal of Computational and Applied Mathematics - Special issue: Scientific computing, computer arithmetic, and validated numerics (SCAN 2004)

Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models

Computers and Operations Research
Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods

Computational Optimization and Applications
Verified Methods for Computing Pareto Sets: General Algorithmic Analysis

International Journal of Applied Mathematics and Computer Science - Verified Methods: Applications in Medicine and Engineering
Using the second-order information in pareto-set computations of a multi-criteria problem

PARA'10 Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume 2
Tuning the interval algorithm for seeking pareto sets of multi-criteria problems

PARA'12 Proceedings of the 11th international conference on Applied Parallel and Scientific Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

A new method for obtaining an outer approximation of the efficient set of nonlinear biobjective optimization problems is presented. It is based on the well known `constraint method', and obtains a superset of the efficient set by computing the regions of 驴-optimality of a finite number of single objective constraint problems. An actual implementation, which makes use of interval tools, shows the applicability of the method and the computational studies on a set of competitive location problems demonstrate its efficiency.