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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have