|
|
|
|
LEADER |
01000caa a22002652 4500 |
001 |
JST063710706 |
003 |
DE-627 |
005 |
20240622102758.0 |
007 |
cr uuu---uuuuu |
008 |
150325s2001 xx |||||o 00| ||eng c |
035 |
|
|
|a (DE-627)JST063710706
|
035 |
|
|
|a (JST)222964
|
040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
041 |
|
|
|a eng
|
100 |
1 |
|
|a Carrizosa, Emilio
|e verfasserin
|4 aut
|
245 |
1 |
0 |
|a Combining Minsum and Minmax: A Goal Programming Approach
|
264 |
|
1 |
|c 2001
|
336 |
|
|
|a Text
|b txt
|2 rdacontent
|
337 |
|
|
|a Computermedien
|b c
|2 rdamedia
|
338 |
|
|
|a Online-Ressource
|b cr
|2 rdacarrier
|
520 |
|
|
|a 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.
|
540 |
|
|
|a Copyright 2001 The Institute for Operations Research and the Management Sciences
|
650 |
|
4 |
|a Decision analysis: multiple criteria theory
|
650 |
|
4 |
|a Facilities: Continuous location/discrete location
|
650 |
|
4 |
|a Decision Making
|
650 |
|
4 |
|a Mathematics
|x Mathematical procedures
|x Mathematical optimization
|x Optimal solutions
|
650 |
|
4 |
|a Behavioral sciences
|x Psychology
|x Cognitive psychology
|x Cognitive processes
|x Decision making
|x Decision analysis
|x Goal programming
|
650 |
|
4 |
|a Mathematics
|x Applied mathematics
|x Statistics
|x Applied statistics
|x Statistical models
|x Parametric models
|
650 |
|
4 |
|a Applied sciences
|x Computer science
|x Computer programming
|x Mathematical programming
|x Nonlinear programming
|x Objective functions
|
650 |
|
4 |
|a Business
|x Industry
|x Industrial sectors
|x Service industries
|x Building services
|x Custodial services
|x Cleaning equipment
|x Mops
|
650 |
|
4 |
|a Mathematics
|x Pure mathematics
|x Linear algebra
|x Vector analysis
|x Vector operations
|x Scalars
|
650 |
|
4 |
|a Mathematics
|x Pure mathematics
|x Geometry
|x Euclidean geometry
|x Plane geometry
|x Vertices
|
655 |
|
4 |
|a research-article
|
700 |
1 |
|
|a Romero-Morales, Dolores
|e verfasserin
|4 aut
|
773 |
0 |
8 |
|i Enthalten in
|t Operations Research
|d Institute for Operations Research and the Management Sciences, 1956
|g 49(2001), 1, Seite 169-174
|w (DE-627)320595005
|w (DE-600)2019440-7
|x 15265463
|7 nnns
|
773 |
1 |
8 |
|g volume:49
|g year:2001
|g number:1
|g pages:169-174
|
856 |
4 |
0 |
|u https://www.jstor.org/stable/222964
|3 Volltext
|
912 |
|
|
|a GBV_USEFLAG_A
|
912 |
|
|
|a SYSFLAG_A
|
912 |
|
|
|a GBV_JST
|
912 |
|
|
|a GBV_ILN_11
|
912 |
|
|
|a GBV_ILN_20
|
912 |
|
|
|a GBV_ILN_22
|
912 |
|
|
|a GBV_ILN_23
|
912 |
|
|
|a GBV_ILN_24
|
912 |
|
|
|a GBV_ILN_31
|
912 |
|
|
|a GBV_ILN_32
|
912 |
|
|
|a GBV_ILN_39
|
912 |
|
|
|a GBV_ILN_40
|
912 |
|
|
|a GBV_ILN_60
|
912 |
|
|
|a GBV_ILN_62
|
912 |
|
|
|a GBV_ILN_63
|
912 |
|
|
|a GBV_ILN_65
|
912 |
|
|
|a GBV_ILN_69
|
912 |
|
|
|a GBV_ILN_70
|
912 |
|
|
|a GBV_ILN_90
|
912 |
|
|
|a GBV_ILN_95
|
912 |
|
|
|a GBV_ILN_100
|
912 |
|
|
|a GBV_ILN_101
|
912 |
|
|
|a GBV_ILN_110
|
912 |
|
|
|a GBV_ILN_120
|
912 |
|
|
|a GBV_ILN_152
|
912 |
|
|
|a GBV_ILN_187
|
912 |
|
|
|a GBV_ILN_224
|
912 |
|
|
|a GBV_ILN_252
|
912 |
|
|
|a GBV_ILN_285
|
912 |
|
|
|a GBV_ILN_374
|
912 |
|
|
|a GBV_ILN_702
|
912 |
|
|
|a GBV_ILN_2001
|
912 |
|
|
|a GBV_ILN_2003
|
912 |
|
|
|a GBV_ILN_2005
|
912 |
|
|
|a GBV_ILN_2006
|
912 |
|
|
|a GBV_ILN_2007
|
912 |
|
|
|a GBV_ILN_2008
|
912 |
|
|
|a GBV_ILN_2009
|
912 |
|
|
|a GBV_ILN_2010
|
912 |
|
|
|a GBV_ILN_2011
|
912 |
|
|
|a GBV_ILN_2014
|
912 |
|
|
|a GBV_ILN_2015
|
912 |
|
|
|a GBV_ILN_2018
|
912 |
|
|
|a GBV_ILN_2020
|
912 |
|
|
|a GBV_ILN_2021
|
912 |
|
|
|a GBV_ILN_2026
|
912 |
|
|
|a GBV_ILN_2027
|
912 |
|
|
|a GBV_ILN_2034
|
912 |
|
|
|a GBV_ILN_2044
|
912 |
|
|
|a GBV_ILN_2048
|
912 |
|
|
|a GBV_ILN_2050
|
912 |
|
|
|a GBV_ILN_2055
|
912 |
|
|
|a GBV_ILN_2056
|
912 |
|
|
|a GBV_ILN_2057
|
912 |
|
|
|a GBV_ILN_2059
|
912 |
|
|
|a GBV_ILN_2061
|
912 |
|
|
|a GBV_ILN_2065
|
912 |
|
|
|a GBV_ILN_2068
|
912 |
|
|
|a GBV_ILN_2088
|
912 |
|
|
|a GBV_ILN_2106
|
912 |
|
|
|a GBV_ILN_2107
|
912 |
|
|
|a GBV_ILN_2108
|
912 |
|
|
|a GBV_ILN_2111
|
912 |
|
|
|a GBV_ILN_2112
|
912 |
|
|
|a GBV_ILN_2113
|
912 |
|
|
|a GBV_ILN_2118
|
912 |
|
|
|a GBV_ILN_2122
|
912 |
|
|
|a GBV_ILN_2129
|
912 |
|
|
|a GBV_ILN_2143
|
912 |
|
|
|a GBV_ILN_2147
|
912 |
|
|
|a GBV_ILN_2148
|
912 |
|
|
|a GBV_ILN_2152
|
912 |
|
|
|a GBV_ILN_2153
|
912 |
|
|
|a GBV_ILN_2190
|
912 |
|
|
|a GBV_ILN_2232
|
912 |
|
|
|a GBV_ILN_2472
|
912 |
|
|
|a GBV_ILN_2935
|
912 |
|
|
|a GBV_ILN_2940
|
912 |
|
|
|a GBV_ILN_2949
|
912 |
|
|
|a GBV_ILN_2950
|
912 |
|
|
|a GBV_ILN_4012
|
912 |
|
|
|a GBV_ILN_4035
|
912 |
|
|
|a GBV_ILN_4037
|
912 |
|
|
|a GBV_ILN_4046
|
912 |
|
|
|a GBV_ILN_4112
|
912 |
|
|
|a GBV_ILN_4125
|
912 |
|
|
|a GBV_ILN_4126
|
912 |
|
|
|a GBV_ILN_4242
|
912 |
|
|
|a GBV_ILN_4246
|
912 |
|
|
|a GBV_ILN_4249
|
912 |
|
|
|a GBV_ILN_4251
|
912 |
|
|
|a GBV_ILN_4305
|
912 |
|
|
|a GBV_ILN_4306
|
912 |
|
|
|a GBV_ILN_4307
|
912 |
|
|
|a GBV_ILN_4313
|
912 |
|
|
|a GBV_ILN_4322
|
912 |
|
|
|a GBV_ILN_4323
|
912 |
|
|
|a GBV_ILN_4324
|
912 |
|
|
|a GBV_ILN_4325
|
912 |
|
|
|a GBV_ILN_4326
|
912 |
|
|
|a GBV_ILN_4335
|
912 |
|
|
|a GBV_ILN_4338
|
912 |
|
|
|a GBV_ILN_4346
|
912 |
|
|
|a GBV_ILN_4393
|
912 |
|
|
|a GBV_ILN_4700
|
951 |
|
|
|a AR
|
952 |
|
|
|d 49
|j 2001
|e 1
|h 169-174
|