Combining Minsum and Minmax

A Goal Programming Approach

Emilio Carrizosa, Dolores Romero Morales

Research output: Contribution to journalJournal articleResearchpeer-review

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.
Original languageEnglish
JournalOperations Research
Volume49
Issue number1
Pages (from-to)169-174
ISSN0030-364X
DOIs
Publication statusPublished - 2001
Externally publishedYes

Cite this

@article{df69363d4b6c4a5bbd9d58f8dfb58e86,
title = "Combining Minsum and Minmax: A Goal Programming Approach",
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.",
keywords = "Decision analysis: Multiple criteria theory, Facilities: Continuous location/discrete location",
author = "Emilio Carrizosa and {Romero Morales}, Dolores",
year = "2001",
doi = "10.1287/opre.49.1.169.11190",
language = "English",
volume = "49",
pages = "169--174",
journal = "Operations Research",
issn = "0030-364X",
publisher = "Institute for Operations Research and the Management Sciences",
number = "1",

}

Combining Minsum and Minmax : A Goal Programming Approach. / Carrizosa, Emilio; Romero Morales, Dolores .

In: Operations Research, Vol. 49, No. 1, 2001, p. 169-174.

Research output: Contribution to journalJournal articleResearchpeer-review

TY - JOUR

T1 - Combining Minsum and Minmax

T2 - A Goal Programming Approach

AU - Carrizosa, Emilio

AU - Romero Morales, Dolores

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

KW - Decision analysis: Multiple criteria theory

KW - Facilities: Continuous location/discrete location

U2 - 10.1287/opre.49.1.169.11190

DO - 10.1287/opre.49.1.169.11190

M3 - Journal article

VL - 49

SP - 169

EP - 174

JO - Operations Research

JF - Operations Research

SN - 0030-364X

IS - 1

ER -