Combining minsum and minmax. A goal programming approach.

Carrizosa, Emilio and Romero-Morales, Dolores (2001) Combining minsum and minmax. A goal programming approach. Operations Research, 49 (1). pp. 169-174.

[img] PDF
Download (112kB)

Abstract

A number of methods for multiple-objective optimization problems (MOP) give as solution to MOP the set of optimal solutions for some single-objective optimization problems associated with it. Well-known examples of these single-objective optimization problems are the minsum and the minmax. In this note, we propose a new parametric single-objective optimization problem associated with MOP by means of Goal Programming ideas. We show that the minsum and minmax are particular instances, so we are somehow combining minsum and minmax by means of a parameter. Moreover, such parameter has a clear meaning in the value space. Applications of this parametric problem to classical models in Locational Analysis are discussed.

Item Type: Article
Keywords: mathematical optimization, decision making, management science
Subject(s): Management science
Date Deposited: 26 May 2011 10:30
Last Modified: 09 Mar 2017 16:36
Funders: N/A
URI: http://eureka.sbs.ox.ac.uk/id/eprint/767

View statistics

Actions (login required)

Edit View Edit View