An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem

This article presents for the first time an algorithm specifically designed for globally minimizing a finite, convex function over the weakly efficient set of a multiple objective nonlinear programming problem (V1) that has both nonlinear objective functions and a convex, nonpolyhedral feasible regi...

Full description

Saved in:
Bibliographic Details
Published in:Journal of global optimization Vol. 52; no. 3; pp. 553 - 574
Main Author: Benson, Harold P.
Format: Journal Article
Language:English
Published: Boston Springer US 01.03.2012
Springer Nature B.V
Subjects:
ISSN:0925-5001, 1573-2916
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract This article presents for the first time an algorithm specifically designed for globally minimizing a finite, convex function over the weakly efficient set of a multiple objective nonlinear programming problem (V1) that has both nonlinear objective functions and a convex, nonpolyhedral feasible region. The algorithm uses a branch and bound search in the outcome space of problem (V1), rather than in the decision space of the problem, to find a global optimal solution. Since the dimension of the outcome space is usually much smaller than the dimension of the decision space, often by one or more orders of magnitude, this approach can be expected to considerably shorten the search. In addition, the algorithm can be easily modified to obtain an approximate global optimal weakly efficient solution after a finite number of iterations. Furthermore, all of the subproblems that the algorithm must solve can be easily solved, since they are all convex programming problems. The key, and sometimes quite interesting, convergence properties of the algorithm are proven, and an example problem is solved.
AbstractList This article presents for the first time an algorithm specifically designed for globally minimizing a finite, convex function over the weakly efficient set of a multiple objective nonlinear programming problem (V1) that has both nonlinear objective functions and a convex, nonpolyhedral feasible region. The algorithm uses a branch and bound search in the outcome space of problem (V1), rather than in the decision space of the problem, to find a global optimal solution. Since the dimension of the outcome space is usually much smaller than the dimension of the decision space, often by one or more orders of magnitude, this approach can be expected to considerably shorten the search. In addition, the algorithm can be easily modified to obtain an approximate global optimal weakly efficient solution after a finite number of iterations. Furthermore, all of the subproblems that the algorithm must solve can be easily solved, since they are all convex programming problems. The key, and sometimes quite interesting, convergence properties of the algorithm are proven, and an example problem is solved.[PUBLICATION ABSTRACT]
This article presents for the first time an algorithm specifically designed for globally minimizing a finite, convex function over the weakly efficient set of a multiple objective nonlinear programming problem (V1) that has both nonlinear objective functions and a convex, nonpolyhedral feasible region. The algorithm uses a branch and bound search in the outcome space of problem (V1), rather than in the decision space of the problem, to find a global optimal solution. Since the dimension of the outcome space is usually much smaller than the dimension of the decision space, often by one or more orders of magnitude, this approach can be expected to considerably shorten the search. In addition, the algorithm can be easily modified to obtain an approximate global optimal weakly efficient solution after a finite number of iterations. Furthermore, all of the subproblems that the algorithm must solve can be easily solved, since they are all convex programming problems. The key, and sometimes quite interesting, convergence properties of the algorithm are proven, and an example problem is solved.
Author Benson, Harold P.
Author_xml – sequence: 1
  givenname: Harold P.
  surname: Benson
  fullname: Benson, Harold P.
  email: harold.benson@warrington.ufl.edu
  organization: Department of Information Systems and Operations Management, University of Florida
BookMark eNp9kM1OxCAURonRxHH0AdwR91WglpblxPiXmLjRNbllLiNjWyowmnHjq8s4JiYmugLCd_gu54DsDn5AQo45O-WM1WeRs0Y1BeO8UHUji_UOmfCqLguhuNwlE6ZEVVSM8X1yEOOSMaaaSkzIx2ygfpWM75HGEQxS6BY-uPTUU-sD9WNyvXuH5HwOvmKg6QnpG8Jzt6ZorTMOh0QjJuotBdqvuuTGDqlvl2iSe0WaJ-3cgBDoGPwiQN-7YbHZtx32h2TPQhfx6Hudksery4eLm-Lu_vr2YnZXmLLhqQCOsrVyzuf5dw0voVL5JLHNF6rmQtkGjG3VeSUBlEVmoFWVFO0caqvKppySk-27ufdlhTHppV-FIVdqJWQleS1EDvFtyAQfY0Crx-B6CGvNmd5o1lvNOmvWG816nZn6F2Nc-tKVArjuX1JsyZhbhgWGn5H-hj4B2HSYew
CitedBy_id crossref_primary_10_1080_02331934_2018_1484922
crossref_primary_10_1007_s11590_020_01554_7
crossref_primary_10_1080_01630563_2020_1871009
crossref_primary_10_1080_10556788_2024_2380688
crossref_primary_10_1007_s10957_016_1030_y
crossref_primary_10_1080_02331934_2020_1730834
crossref_primary_10_1016_j_ejor_2020_09_045
crossref_primary_10_1111_itor_13547
crossref_primary_10_1007_s10479_020_03820_4
crossref_primary_10_1007_s12351_021_00664_z
Cites_doi 10.1023/A:1026544116333
10.1007/BF00120667
10.1007/BF02207641
10.1287/moor.8.1.64
10.1016/S0167-6377(01)00052-9
10.1016/S0377-2217(98)00230-6
10.1080/02331930600808533
10.1016/S0377-2217(00)00297-6
10.1016/0167-6377(85)90046-X
10.1007/0-387-30528-9_1
10.1023/A:1008336124425
10.1016/0377-2217(86)90085-8
10.1007/BF01580678
10.1007/s10898-004-2707-6
10.1016/S0377-2217(99)00068-5
10.1002/mcda.369
10.1016/S0377-2217(01)00301-0
10.1137/1013001
10.1007/BF00940077
10.1023/A:1021765131316
10.1016/0377-2217(88)90257-3
10.1016/0022-247X(84)90269-5
10.1023/A:1013875600711
10.1023/A:1023993504522
10.15807/jorsj.32.143
10.1515/9781400873173
10.1007/978-1-4757-2809-5
10.1016/0167-188X(86)90030-3
10.1007/978-3-642-46802-5_28
10.1007/978-1-4615-4098-4
10.1007/978-3-642-50280-4
ContentType Journal Article
Copyright Springer Science+Business Media, LLC. (outside the USA) 2011
Springer Science+Business Media, LLC. 2012
Copyright_xml – notice: Springer Science+Business Media, LLC. (outside the USA) 2011
– notice: Springer Science+Business Media, LLC. 2012
DBID AAYXX
CITATION
3V.
7SC
7WY
7WZ
7XB
87Z
88I
8AL
8AO
8FD
8FE
8FG
8FK
8FL
8G5
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FRNLG
F~G
GNUQQ
GUQSH
HCIFZ
JQ2
K60
K6~
K7-
L.-
L.0
L6V
L7M
L~C
L~D
M0C
M0N
M2O
M2P
M7S
MBDVC
P5Z
P62
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
DOI 10.1007/s10898-011-9786-y
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Science Database (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni Edition)
Research Library (Alumni Edition)
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central (subscription)
Business Premium Collection
Technology collection
ProQuest One Community College
ProQuest Central
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
Research Library Prep
SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
ABI/INFORM Professional Advanced
ABI/INFORM Professional Standard
ProQuest Engineering Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ABI/INFORM Global
Computing Database
Research Library
Science Database
Engineering Database
Research Library (Corporate)
ProQuest advanced technologies & aerospace journals
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Business (UW System Shared)
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering collection
ProQuest Central Basic
DatabaseTitle CrossRef
ProQuest Business Collection (Alumni Edition)
Research Library Prep
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
SciTech Premium Collection
ProQuest Central China
ABI/INFORM Complete
ProQuest One Applied & Life Sciences
ProQuest Central (New)
Engineering Collection
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
Engineering Database
ProQuest Science Journals (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest Business Collection
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest One Academic (New)
ABI/INFORM Global (Corporate)
ProQuest One Business
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Central (Alumni Edition)
ProQuest One Community College
Research Library (Alumni Edition)
ProQuest Pharma Collection
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ABI/INFORM Professional Standard
ProQuest Central Korea
ProQuest Research Library
Advanced Technologies Database with Aerospace
ABI/INFORM Complete (Alumni Edition)
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Science Journals
ProQuest Computing (Alumni Edition)
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList ProQuest Business Collection (Alumni Edition)

Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central (subscription)
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
Sciences (General)
Computer Science
EISSN 1573-2916
EndPage 574
ExternalDocumentID 2603939791
10_1007_s10898_011_9786_y
Genre Feature
GroupedDBID -52
-57
-5G
-BR
-EM
-Y2
-~C
.4S
.86
.DC
.VR
06D
0R~
0VY
199
1N0
1SB
2.D
203
28-
29K
2J2
2JN
2JY
2KG
2LR
2P1
2VQ
2~H
30V
3V.
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
78A
7WY
88I
8AO
8FE
8FG
8FL
8G5
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYOK
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTAH
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACGOD
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACZOJ
ADHHG
ADHIR
ADIMF
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFEXP
AFGCZ
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHSBF
AHYZX
AI.
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARCSS
ARMRJ
ASPBG
AVWKF
AXYYD
AYQZM
AZFZN
AZQEC
B-.
BA0
BAPOH
BBWZM
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
CAG
CCPQU
COF
CS3
CSCUP
D-I
DDRTE
DL5
DNIVK
DPUIP
DU5
DWQXO
EBLON
EBS
EDO
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ6
GQ7
GQ8
GROUPED_ABI_INFORM_COMPLETE
GUQSH
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I09
IAO
IHE
IJ-
IKXTQ
ITC
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K60
K6V
K6~
K7-
KDC
KOV
KOW
L6V
LAK
LLZTM
M0C
M0N
M2O
M2P
M4Y
M7S
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P62
P9M
PF0
PQBIZ
PQBZA
PQQKQ
PROAC
PT4
PT5
PTHSS
Q2X
QOK
QOS
R4E
R89
R9I
RHV
RNI
RNS
ROL
RPX
RSV
RZC
RZE
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SBE
SCLPG
SDD
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TEORI
TN5
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
VH1
W23
W48
WK8
YLTOR
Z45
Z5O
Z7R
Z7X
Z7Z
Z81
Z83
Z86
Z88
Z8M
Z8N
Z8T
Z8U
Z8W
Z92
ZMTXR
ZWQNP
ZY4
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
AEZWR
AFDZB
AFFHD
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
AMVHM
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PQGLB
7SC
7XB
8AL
8FD
8FK
JQ2
L.-
L.0
L7M
L~C
L~D
MBDVC
PKEHL
PQEST
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c381t-a1e6bf6d1d978813a59f6d6eba1e97129f8acfb9456aa9fe0cab9562bda7f9383
IEDL.DBID M2P
ISICitedReferencesCount 12
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000301842600012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0925-5001
IngestDate Tue Nov 04 19:46:04 EST 2025
Tue Nov 18 22:13:26 EST 2025
Sat Nov 29 01:59:30 EST 2025
Fri Feb 21 02:42:28 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords Global optimization
Multiple objective nonlinear programming
Branch and bound
Weakly efficient set
Language English
License http://www.springer.com/tdm
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c381t-a1e6bf6d1d978813a59f6d6eba1e97129f8acfb9456aa9fe0cab9562bda7f9383
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 926561722
PQPubID 29930
PageCount 22
ParticipantIDs proquest_journals_926561722
crossref_primary_10_1007_s10898_011_9786_y
crossref_citationtrail_10_1007_s10898_011_9786_y
springer_journals_10_1007_s10898_011_9786_y
PublicationCentury 2000
PublicationDate 2012-03-01
PublicationDateYYYYMMDD 2012-03-01
PublicationDate_xml – month: 03
  year: 2012
  text: 2012-03-01
  day: 01
PublicationDecade 2010
PublicationPlace Boston
PublicationPlace_xml – name: Boston
– name: Dordrecht
PublicationSubtitle An International Journal Dealing with Theoretical and Computational Aspects of Seeking Global Optima and Their Applications in Science, Management and Engineering
PublicationTitle Journal of global optimization
PublicationTitleAbbrev J Glob Optim
PublicationYear 2012
Publisher Springer US
Springer Nature B.V
Publisher_xml – name: Springer US
– name: Springer Nature B.V
References Luc (CR25) 2001; 26
Borwein (CR10) 1983; 8
Luc (CR24) 1989
Bazaraa, Sherali, Shetty (CR4) 1993
Benson (CR8) 1992; 73
Fulop, Komlosi, Rapcsak, Schaible (CR14) 1994
Konno, Inori (CR21) 1989; 32
Ehrgott (CR13) 2005
Geoffrion (CR15) 1971; 13
Kim (CR20) 2000; 28
Arrow, Barankin, Blackwell, Kuhn, Tucker (CR3) 1953
Benson (CR6) 1986; 25
Muu (CR27) 2000; 25
Phong, Tuyen (CR28) 2000; 28
Sosa, Raupp (CR31) 2007; 56
Benson (CR9) 2005; 13
Horst, Thoai (CR17) 1999; 103
Weistroffer (CR39) 1985; 4
Dessouky, Ghiassi, Davis (CR11) 1986; 10
Yu (CR43) 1985
Ecker, Song (CR12) 1994; 83
Sawaragi, Nakayama, Tanino (CR30) 1985
Miettinen (CR26) 1999
Steuer (CR32) 1986
Tuy (CR35) 1998
Yamada, Tanino, Inuiguchi (CR40) 2000; 16
Isermann, Steuer (CR19) 1987; 33
Horst (CR16) 1976; 10
Thoai (CR34) 2000; 18
Horst, Thoai (CR18) 1999; 117
Yamada, Tanino, Inuiguchi (CR41) 2001; 133
Yamamoto (CR42) 2002; 22
Thoai (CR33) 2000; 122
Benson (CR5) 1984; 98
Benson (CR7) 1991; 1
CR23
Tuyen, Muu (CR38) 2001; 28
Zeleny (CR44) 1982
An, Tao, Thoai (CR1) 2002; 142
An, Dinh, Muu (CR2) 2003; 117
Rockafellar (CR29) 1970
Konno, Thach, Tuy (CR22) 1997
Tuy (CR36) 2005; 32
Tuy, Phuong, Liberti, Maculan (CR37) 2006
H. Konno (9786_CR21) 1989; 32
L.T. Luc (9786_CR25) 2001; 26
S. Yamada (9786_CR41) 2001; 133
H.P. Benson (9786_CR7) 1991; 1
N.T.B. Kim (9786_CR20) 2000; 28
H.Q. Tuyen (9786_CR38) 2001; 28
9786_CR23
H.P. Benson (9786_CR6) 1986; 25
N.V. Thoai (9786_CR33) 2000; 122
H.P. Benson (9786_CR9) 2005; 13
L.T.H. An (9786_CR1) 2002; 142
L.T.H. An (9786_CR2) 2003; 117
W. Sosa (9786_CR31) 2007; 56
N.V. Thoai (9786_CR34) 2000; 18
K.M. Miettinen (9786_CR26) 1999
A.M. Geoffrion (9786_CR15) 1971; 13
H. Tuy (9786_CR36) 2005; 32
Y. Sawaragi (9786_CR30) 1985
R.E. Steuer (9786_CR32) 1986
J. Borwein (9786_CR10) 1983; 8
P.L. Yu (9786_CR43) 1985
R. Horst (9786_CR16) 1976; 10
J. Fulop (9786_CR14) 1994
K.J. Arrow (9786_CR3) 1953
M. Ehrgott (9786_CR13) 2005
R. Horst (9786_CR18) 1999; 117
Y. Yamamoto (9786_CR42) 2002; 22
H. Isermann (9786_CR19) 1987; 33
H. Tuy (9786_CR35) 1998
H.P. Benson (9786_CR8) 1992; 73
R.T. Rockafellar (9786_CR29) 1970
M. Zeleny (9786_CR44) 1982
M.S. Bazaraa (9786_CR4) 1993
R. Horst (9786_CR17) 1999; 103
M. Dessouky (9786_CR11) 1986; 10
T.Q. Phong (9786_CR28) 2000; 28
S. Yamada (9786_CR40) 2000; 16
J.G. Ecker (9786_CR12) 1994; 83
H.P. Benson (9786_CR5) 1984; 98
H.R. Weistroffer (9786_CR39) 1985; 4
H. Konno (9786_CR22) 1997
D.T. Luc (9786_CR24) 1989
L.D. Muu (9786_CR27) 2000; 25
H. Tuy (9786_CR37) 2006
References_xml – volume: 25
  start-page: 67
  year: 2000
  end-page: 85
  ident: CR27
  article-title: A convex-concave programming method for optimizing over the efficient set
  publication-title: Acta Math. Vietnam.
– year: 2005
  ident: CR13
  publication-title: Multicriteria Optimization
– volume: 18
  start-page: 321
  year: 2000
  end-page: 336
  ident: CR34
  article-title: Conical algorithm in global optimization for optimizing over efficient sets
  publication-title: J. Glob. Optim.
  doi: 10.1023/A:1026544116333
– volume: 1
  start-page: 82
  year: 1991
  end-page: 104
  ident: CR7
  article-title: An all-linear programming relaxation algorithm for optimizing over the efficient set
  publication-title: J. Glob. Optim.
  doi: 10.1007/BF00120667
– volume: 83
  start-page: 541
  year: 1994
  end-page: 563
  ident: CR12
  article-title: Optimizing a linear function over an efficient set
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/BF02207641
– year: 1989
  ident: CR24
  publication-title: Theory of Vector Optimization
– year: 1986
  ident: CR32
  publication-title: Multiple Criteria Optimization: Theory, Computation, and Application
– year: 1982
  ident: CR44
  publication-title: Multiple Criteria Decision Making
– volume: 8
  start-page: 64
  year: 1983
  end-page: 73
  ident: CR10
  article-title: On the existence of Pareto efficient points
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.8.1.64
– volume: 28
  start-page: 81
  year: 2001
  end-page: 92
  ident: CR38
  article-title: Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
  publication-title: Oper. Res. Lett.
  doi: 10.1016/S0167-6377(01)00052-9
– year: 1985
  ident: CR43
  publication-title: Multiple-Criteria Decision Making
– volume: 32
  start-page: 143
  year: 1989
  end-page: 158
  ident: CR21
  article-title: Bond portfolio optimization by bilinear fractional programming
  publication-title: J. Oper. Res. Soc. Jpn.
– volume: 26
  start-page: 65
  year: 2001
  end-page: 80
  ident: CR25
  article-title: Reverse polyblock approximation for optimizing over the weakly efficient set and efficient set
  publication-title: Acta Math. Vietnam.
– year: 1998
  ident: CR35
  publication-title: Convex Analysis and Global Optimization
– volume: 117
  start-page: 239
  year: 1999
  end-page: 252
  ident: CR18
  article-title: Maximizing a concave function over the efficient or weakly efficient set
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/S0377-2217(98)00230-6
– volume: 56
  start-page: 207
  year: 2007
  end-page: 219
  ident: CR31
  article-title: On minimization over weakly efficient sets
  publication-title: Optimization
  doi: 10.1080/02331930600808533
– volume: 10
  start-page: 95
  year: 1986
  end-page: 104
  ident: CR11
  article-title: Estimates of the minimum nondominated criterion values in multiple-criteria decision-making
  publication-title: Eng. Costs Prod. Econ.
– volume: 133
  start-page: 267
  year: 2001
  end-page: 286
  ident: CR41
  article-title: An inner approximation method incorporating a branch and bound procedure for optimization over the weakly-efficient set
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/S0377-2217(00)00297-6
– year: 1997
  ident: CR22
  publication-title: Optimization on Low Rank Nonconvex Structures
– volume: 4
  start-page: 23
  year: 1985
  end-page: 25
  ident: CR39
  article-title: Careful usage of pessimistic values is needed in multiple objectives optimization
  publication-title: Oper. Res. Lett.
  doi: 10.1016/0167-6377(85)90046-X
– ident: CR23
– start-page: 3
  year: 2006
  end-page: 31
  ident: CR37
  article-title: Optimization under composite monotonic constraints and constrained optimization over efficient sets
  publication-title: Global Optimization
  doi: 10.1007/0-387-30528-9_1
– volume: 16
  start-page: 197
  year: 2000
  end-page: 217
  ident: CR40
  article-title: An inner approximation method for optimization, over the weakly-efficient set
  publication-title: J. Glob. Optim.
  doi: 10.1023/A:1008336124425
– volume: 25
  start-page: 192
  year: 1986
  end-page: 199
  ident: CR6
  article-title: An algorithm for optimizing over the weakly efficient set
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/0377-2217(86)90085-8
– volume: 10
  start-page: 312
  year: 1976
  end-page: 321
  ident: CR16
  article-title: An algorithm for nonconvex programming problems
  publication-title: Math. Prog.
  doi: 10.1007/BF01580678
– volume: 32
  start-page: 307
  year: 2005
  end-page: 323
  ident: CR36
  article-title: Robust solution of nonconvex global optimization problems
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-004-2707-6
– year: 1985
  ident: CR30
  publication-title: Theory of Multiobjective Optimization
– volume: 122
  start-page: 58
  year: 2000
  end-page: 68
  ident: CR33
  article-title: A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/S0377-2217(99)00068-5
– volume: 13
  start-page: 15
  year: 2005
  end-page: 28
  ident: CR9
  article-title: A global optimization approach for generating efficient points for multiobjective concave fractional programs
  publication-title: J. Multi Criteria Decis. Anal.
  doi: 10.1002/mcda.369
– volume: 28
  start-page: 217
  year: 2000
  end-page: 226
  ident: CR28
  article-title: Bisection search algorithm for optimizing over the efficient set
  publication-title: Vietnam J. Math.
– volume: 142
  start-page: 258
  year: 2002
  end-page: 270
  ident: CR1
  article-title: Combination between global and local methods for solving an optimization problem over the efficient set
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/S0377-2217(01)00301-0
– year: 1999
  ident: CR26
  publication-title: Nonlinear Multiobjective Optimization
– volume: 13
  start-page: 1
  year: 1971
  end-page: 37
  ident: CR15
  article-title: Duality in nonlinear programming: a simplified applications-oriented development
  publication-title: SIAM Rev.
  doi: 10.1137/1013001
– volume: 73
  start-page: 47
  year: 1992
  end-page: 64
  ident: CR8
  article-title: A finite, non-adjacent extreme point search algorithm for optimization over the efficient set
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/BF00940077
– volume: 103
  start-page: 1
  year: 1999
  end-page: 43
  ident: CR17
  article-title: DC programming: overview
  publication-title: J. Optim. Theory Appl.
  doi: 10.1023/A:1021765131316
– volume: 28
  start-page: 329
  year: 2000
  end-page: 340
  ident: CR20
  article-title: An algorithm for optimizing over the efficient set
  publication-title: Vietnam J. Math.
– year: 1970
  ident: CR29
  publication-title: Convex Analysis
– start-page: 87
  year: 1953
  end-page: 91
  ident: CR3
  article-title: Admissible points of convex sets
  publication-title: Contributions to the Theory of Games
– year: 1993
  ident: CR4
  publication-title: Nonlinear Programming—Theory and Algorithms
– volume: 33
  start-page: 91
  year: 1987
  end-page: 97
  ident: CR19
  article-title: Computational experience concerning payoff tables and minimum criterion values over the efficient set
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/0377-2217(88)90257-3
– volume: 98
  start-page: 562
  year: 1984
  end-page: 580
  ident: CR5
  article-title: Optimization over the efficient set
  publication-title: J. Math. Anal. Appl.
  doi: 10.1016/0022-247X(84)90269-5
– start-page: 374
  year: 1994
  end-page: 385
  ident: CR14
  article-title: A cutting plane algorithm for linear optimization over the efficient set
  publication-title: Generalized Convexity
– volume: 22
  start-page: 285
  year: 2002
  end-page: 317
  ident: CR42
  article-title: Optimization over the efficient set: overview
  publication-title: J. Glob. Optim.
  doi: 10.1023/A:1013875600711
– volume: 117
  start-page: 503
  year: 2003
  end-page: 531
  ident: CR2
  article-title: Simplicially-constrained DC optimization over efficient and weakly efficient sets
  publication-title: J. Optim. Theory Appl.
  doi: 10.1023/A:1023993504522
– volume: 1
  start-page: 82
  year: 1991
  ident: 9786_CR7
  publication-title: J. Glob. Optim.
  doi: 10.1007/BF00120667
– volume: 26
  start-page: 65
  year: 2001
  ident: 9786_CR25
  publication-title: Acta Math. Vietnam.
– volume: 142
  start-page: 258
  year: 2002
  ident: 9786_CR1
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/S0377-2217(01)00301-0
– volume: 28
  start-page: 329
  year: 2000
  ident: 9786_CR20
  publication-title: Vietnam J. Math.
– volume: 22
  start-page: 285
  year: 2002
  ident: 9786_CR42
  publication-title: J. Glob. Optim.
  doi: 10.1023/A:1013875600711
– volume-title: Nonlinear Programming—Theory and Algorithms
  year: 1993
  ident: 9786_CR4
– volume: 13
  start-page: 1
  year: 1971
  ident: 9786_CR15
  publication-title: SIAM Rev.
  doi: 10.1137/1013001
– volume: 98
  start-page: 562
  year: 1984
  ident: 9786_CR5
  publication-title: J. Math. Anal. Appl.
  doi: 10.1016/0022-247X(84)90269-5
– volume: 32
  start-page: 143
  year: 1989
  ident: 9786_CR21
  publication-title: J. Oper. Res. Soc. Jpn.
  doi: 10.15807/jorsj.32.143
– volume: 28
  start-page: 217
  year: 2000
  ident: 9786_CR28
  publication-title: Vietnam J. Math.
– volume-title: Multiple-Criteria Decision Making
  year: 1985
  ident: 9786_CR43
– volume: 4
  start-page: 23
  year: 1985
  ident: 9786_CR39
  publication-title: Oper. Res. Lett.
  doi: 10.1016/0167-6377(85)90046-X
– volume-title: Convex Analysis
  year: 1970
  ident: 9786_CR29
  doi: 10.1515/9781400873173
– volume-title: Multiple Criteria Optimization: Theory, Computation, and Application
  year: 1986
  ident: 9786_CR32
– volume-title: Multiple Criteria Decision Making
  year: 1982
  ident: 9786_CR44
– volume-title: Convex Analysis and Global Optimization
  year: 1998
  ident: 9786_CR35
  doi: 10.1007/978-1-4757-2809-5
– volume-title: Multicriteria Optimization
  year: 2005
  ident: 9786_CR13
– volume: 32
  start-page: 307
  year: 2005
  ident: 9786_CR36
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-004-2707-6
– volume: 103
  start-page: 1
  year: 1999
  ident: 9786_CR17
  publication-title: J. Optim. Theory Appl.
  doi: 10.1023/A:1021765131316
– volume: 56
  start-page: 207
  year: 2007
  ident: 9786_CR31
  publication-title: Optimization
  doi: 10.1080/02331930600808533
– volume: 25
  start-page: 192
  year: 1986
  ident: 9786_CR6
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/0377-2217(86)90085-8
– volume: 33
  start-page: 91
  year: 1987
  ident: 9786_CR19
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/0377-2217(88)90257-3
– volume: 28
  start-page: 81
  year: 2001
  ident: 9786_CR38
  publication-title: Oper. Res. Lett.
  doi: 10.1016/S0167-6377(01)00052-9
– volume: 13
  start-page: 15
  year: 2005
  ident: 9786_CR9
  publication-title: J. Multi Criteria Decis. Anal.
  doi: 10.1002/mcda.369
– volume: 122
  start-page: 58
  year: 2000
  ident: 9786_CR33
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/S0377-2217(99)00068-5
– volume: 18
  start-page: 321
  year: 2000
  ident: 9786_CR34
  publication-title: J. Glob. Optim.
  doi: 10.1023/A:1026544116333
– volume-title: Nonlinear Multiobjective Optimization
  year: 1999
  ident: 9786_CR26
– volume: 16
  start-page: 197
  year: 2000
  ident: 9786_CR40
  publication-title: J. Glob. Optim.
  doi: 10.1023/A:1008336124425
– volume: 117
  start-page: 503
  year: 2003
  ident: 9786_CR2
  publication-title: J. Optim. Theory Appl.
  doi: 10.1023/A:1023993504522
– volume: 10
  start-page: 312
  year: 1976
  ident: 9786_CR16
  publication-title: Math. Prog.
  doi: 10.1007/BF01580678
– ident: 9786_CR23
– start-page: 87
  volume-title: Contributions to the Theory of Games
  year: 1953
  ident: 9786_CR3
– start-page: 3
  volume-title: Global Optimization
  year: 2006
  ident: 9786_CR37
  doi: 10.1007/0-387-30528-9_1
– volume: 117
  start-page: 239
  year: 1999
  ident: 9786_CR18
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/S0377-2217(98)00230-6
– volume: 10
  start-page: 95
  year: 1986
  ident: 9786_CR11
  publication-title: Eng. Costs Prod. Econ.
  doi: 10.1016/0167-188X(86)90030-3
– volume: 8
  start-page: 64
  year: 1983
  ident: 9786_CR10
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.8.1.64
– volume: 25
  start-page: 67
  year: 2000
  ident: 9786_CR27
  publication-title: Acta Math. Vietnam.
– start-page: 374
  volume-title: Generalized Convexity
  year: 1994
  ident: 9786_CR14
  doi: 10.1007/978-3-642-46802-5_28
– volume: 83
  start-page: 541
  year: 1994
  ident: 9786_CR12
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/BF02207641
– volume: 133
  start-page: 267
  year: 2001
  ident: 9786_CR41
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/S0377-2217(00)00297-6
– volume-title: Theory of Multiobjective Optimization
  year: 1985
  ident: 9786_CR30
– volume: 73
  start-page: 47
  year: 1992
  ident: 9786_CR8
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/BF00940077
– volume-title: Optimization on Low Rank Nonconvex Structures
  year: 1997
  ident: 9786_CR22
  doi: 10.1007/978-1-4615-4098-4
– volume-title: Theory of Vector Optimization
  year: 1989
  ident: 9786_CR24
  doi: 10.1007/978-3-642-50280-4
SSID ssj0009852
Score 2.0176225
Snippet This article presents for the first time an algorithm specifically designed for globally minimizing a finite, convex function over the weakly efficient set of...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 553
SubjectTerms Algorithms
Approximation
Computer Science
Mathematics
Mathematics and Statistics
Nonlinear programming
Operations management
Operations Research/Decision Theory
Optimization
Pareto optimum
Real Functions
Studies
SummonAdditionalLinks – databaseName: Springer Journals New Starts & Take-Overs Collection
  dbid: RSV
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8MwDLZgcIADjwFiDJAPHHgoUtv1lSNCIA4wIV7arUraFAbbitYOtBN_HbdNGSBAgmObNI1kx_6s2J8BdloUdcSeNFhkSJ_Zru0xaUubSSUdxwkJ8Jckrmdeu-13OvxC13GnVbZ7dSVZWOoPxW5-Xg5mmowiH5eNp2GGvJ2f92u4vLqdMO36RZsdg1sOc8gIV1eZ3y3x2RlNEOaXS9HC15ws_muXS7CgoSUelrqwDFNqUIfFqm0D6lNch_kPHIT0dP5O3JrWYVnPSnFXE1LvrcDr4QCTUUYbUEgGKFQoenfJsJvd95EwLyZkdvq6nhPzlFCkFfFFicfeGFXBUUGuDVOVYRKjwCqJERP5UNpbHJSMHWKIOmGsT5tD3e1mFW5Ojq-PTplu3MBCAgAZE6ZyZexGZsRztvqWcDg9uUrSAPcIYcS-CGPJCbwJwWNlhEJSnGbJSHgxp5h5DWr0X7UOSG8opBORcMPIllwIy7W4GSnTVy6pF2-AUUkwCDWred5coxdM-JhziQQkkSCXSDBuwP77J08lpcdvk5uVWgT6dKcBtwgFE_KzGnBQacFk9Me1Nv40uwlzBM6sMt9tE2rZcKS2YDZ8zrrpcLvQ-TfM4wAf
  priority: 102
  providerName: Springer Nature
Title An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
URI https://link.springer.com/article/10.1007/s10898-011-9786-y
https://www.proquest.com/docview/926561722
Volume 52
WOSCitedRecordID wos000301842600012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: ABI/INFORM Collection
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: 7WY
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: M0C
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: K7-
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: M7S
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest advanced technologies & aerospace journals
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: P5Z
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central (subscription)
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: BENPR
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Research Library
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: M2O
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/pqrl
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Science Database
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: M2P
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/sciencejournals
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: Springer Journals New Starts & Take-Overs Collection
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB7RlgM9AC1ULIVqDhwKyGrizcsnVKpWSLTbqKXPS2Q7Dm3Z3ZRNCtoTf51x4nQBqb1wGcl52JHGnvkmHn8D8KZPUUcRK4_lnkpYEAUxU4EKmDIqDENNgL8lcd2NB4Pk9FSkLjencmmVnU1sDHVeavuPfENwQh7kbfmH6-_MFo2ym6uugsYcLBCw8W1G1x5PZ5y7SVNwxxM8ZCGZ425Tsz05l9izZb7PKIyK2PRvtzTDmv9sjzZeZ-fJf37vU3js4CZutvNjCR6Y8TIs_kFCuAxLbnlXuO44qN8-g1-bYyxvahrKINkcbVAOv1L_9cUICeZiSZZm5I5wos0CRQKS-NPIb8MpmoaWgrwZVqbGskCJXd4iluqqNbE4bkk65ARdjtiIPgddgZvncLSz_WXrE3O1Gpgmn18z6ZtIFVHu58IS1PdlKKgVGUU3REygokikLpQgvCalKIynpaLQjKtcxoWgMHkF5mlc8wKQrlAUJ3MZ6TxQQkoeceHnxk9MRDNK9MDrVJVpR2Ru62kMsxkFs9VuRtrNrHazaQ_e3b5y3bJ43PfwaqfRzC3oKrtVZw_ed1NidvfOvl7e29cqPCL8xduUtlcwX09uzGt4qH_Ul9VkDebik7M1WPi4PUgPqPU5ZiT3vC0r-X4jUyvjQ5JpeE7y4PD4N0L7BpA
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB5RitRyaAsFsd0-5kClUmSRmLx8qCrUFoHYrjhQiVuwHQcKuxu6CV3tqb-o_7HjxGFppXLjwDEvO3Y-zyOe-QZgfZu8jjxWHss8lbAgCmKmAhUwZVQYhpoM_obEtRf3-8nxsTicg99tLowNq2xlYi2os0Lbf-RbgpPlQdqWf7z8wWzRKLu52lbQaFBxYKYT8tjKD_uf6fO-5Xz3y9GnPeaKCjBNyqli0jeRyqPMz4RlUt-WoaCjyCi6IGLSfnkida4EGRZSitx4WiryIbjKZJwL8ueo3QfwMLDEYjZSkB_OOH6TusCPJ3jIQhL_7SZqk6mX2Fw232fUbcSmf6vBmW37z3ZsreV2n96z-XkGT5w5jTsN_pdgzoyWYfEGyeIyLDnxVeI7x7G98Rx-7YywuKpoaAZJpmqDcnBK46nOhkhmPBYkSYcuRRVtlCuSoYwTIy8GUzQ17QZpayxNhUWOEtu4TCzUeaNCcNSQkMgxuhi4Ib0OugI-K_DtTqZlFeapX7MGSGfIS5WZjHQWKCElj7jwM-MnJqIVIzrgtdBItSNqt_VCBumMYtqiKSU0pRZN6bQD768fuWxYSm67udsiKHUCq0yv4dOBzRaCs6v_bevFrW29gUd7R197aW-_f9CFx2Rr8iZ87yXMV-Mr8woW9M_qezl-XS8khJO7RuYfz51d_g
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB5RWlXlQAttxUJb5kClPmRtYvLyoapQ6QoEWu2hSKiX1HYcaNndwCaA9sTv6r_rOHHYFgluHHrMy46dz_OIZ74B2NgkryOPlccyTyUsiIKYqUAFTBkVhqEmg78hcd2P-_3k8FAM5uB3mwtjwypbmVgL6qzQ9h95V3CyPEjb8m7uoiIG273Pp2fMFpCyG61tNY0GIXtmekneW_lpd5s-9VvOe1-_fdlhrsAA06SoKiZ9E6k8yvxMWFb1TRkKOoqMogsiJk2YJ1LnSpCRIaXIjaelIn-Cq0zGuSDfjtp9AA9jcjFtNOEg_D7j-03qYj-e4CELSRW0G6pN1l5i89p8n1G3EZv-qxJndu6Nrdla4_We_sdz9QwWnZmNW826WII5M16Ghb_IF5dhyYm1Et857u33z-Fqa4zFeUXDNEiyVhuUwyMaT3U8QjLvsSAJO3Kpq2ijX5EMaLw08mQ4RVPTcZAWx9JUWOQosY3XxEL9alQLjhtyEjlBFxs3otdBV9jnBRzcy7S8hHnq16wA0hnyXmUmI50FSkjJIy78zPiJiWgliQ54LUxS7QjcbR2RYTqjnrbISglZqUVWOu3Ah-tHThv2krtuXmvRlDpBVqbXUOrAxxaOs6u3trV6Z1vr8JgAme7v9vfW4AmZoLyJ6nsF89Xk3LyGR_qi-llO3tRrCuHHfQPzD_9IZuo
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+outcome+space+algorithm+for+optimization+over+the+weakly+efficient+set+of+a+multiple+objective+nonlinear+programming+problem&rft.jtitle=Journal+of+global+optimization&rft.au=Benson%2C+Harold+P&rft.date=2012-03-01&rft.pub=Springer+Nature+B.V&rft.issn=0925-5001&rft.eissn=1573-2916&rft.volume=52&rft.issue=3&rft.spage=553&rft_id=info:doi/10.1007%2Fs10898-011-9786-y&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=2603939791
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-5001&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-5001&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-5001&client=summon