Combining minsum and minmax. A Goal Programming Approach

M.D. Romero Morales; E. Carrizosa

doi:10.1287/opre.49.1.169.11190

Combining minsum and minmax. A Goal Programming Approach

M.D. Romero Morales, E. Carrizosa^*

^*Corresponding author for this work

Quantitative Economics

Research output: Contribution to journal › Article › Academic › peer-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 language	English
Pages (from-to)	169-174
Journal	Operations Research
Volume	49
Issue number	1
DOIs	https://doi.org/10.1287/opre.49.1.169.11190
Publication status	Published - 1 Jan 2001

Access to Document

10.1287/opre.49.1.169.11190Licence: Unspecified

Cite this

@article{559a88ca4578438289a4938ef7f9aa21,

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.",

author = "{Romero Morales}, M.D. and E. Carrizosa",

year = "2001",

month = jan,

day = "1",

doi = "10.1287/opre.49.1.169.11190",

language = "English",

volume = "49",

pages = "169--174",

journal = "Operations Research",

issn = "0030-364X",

publisher = "INFORMS",

number = "1",

}

TY - JOUR

T1 - Combining minsum and minmax. A Goal Programming Approach

AU - Romero Morales, M.D.

AU - Carrizosa, E.

PY - 2001/1/1

Y1 - 2001/1/1

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.

U2 - 10.1287/opre.49.1.169.11190

DO - 10.1287/opre.49.1.169.11190

M3 - Article

SN - 0030-364X

VL - 49

SP - 169

EP - 174

JO - Operations Research

JF - Operations Research

IS - 1

ER -

Combining minsum and minmax. A Goal Programming Approach

Abstract

Access to Document

Fingerprint

Cite this