Paper Info
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.
Year
DOI
Venue
2001
10.1287/opre.49.1.169.11190
Operations Research
Keywords
DocType
Volume
clear meaning,goal programming idea,optimal solution,classical model,combining minsum,parametric problem,single-objective optimization problem,new parametric single-objective optimization,well-known example,locational analysis,multiple-objective optimization problem
Journal
49
Issue
ISSN
Citations 
1
0030-364X
4
PageRank 
References 
Authors
0.46
2
2
Name
Order
Citations
PageRank
Emilio Carrizosa138446.59
Dolores Romero-Morales261.19