A Bilinear Algorithm for Optimizing a Linear Function over the Efficient Set of a Multiple Objective Linear Programming Problem

The problem Q of optimizing a linear function over the efficient set of a multiple objective linear program serves several useful purposes in multiple criteria decision making. However, Q is in itself a difficult global optimization problem, whose local optima, frequently large in number, need not b...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of global optimization Ročník 31; číslo 1; s. 1 - 16
Hlavný autor: Jorge, Jesús M.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Dordrecht Springer Nature B.V 01.01.2005
Predmet:
ISSN:0925-5001, 1573-2916
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract The problem Q of optimizing a linear function over the efficient set of a multiple objective linear program serves several useful purposes in multiple criteria decision making. However, Q is in itself a difficult global optimization problem, whose local optima, frequently large in number, need not be globally optimal. Indeed, this is due to the fact that the feasible region of Q is, in general, a nonconvex set. In this paper we present a monotonically increasing algorithm that finds an exact, globally-optimal solution for Q. Our approach does not require any hypothesis on the boundedness of neither the efficient set EP nor the optimal objective value. The proposed algorithm relies on a simplified disjoint bilinear program that can be solved through the use of well-known specifically designed methods within nonconvex optimization. The algorithm has been implemented in C and preliminary numerical results are reported. [PUBLICATION ABSTRACT]
AbstractList The problem Q of optimizing a linear function over the efficient set of a multiple objective linear program serves several useful purposes in multiple criteria decision making. However, Q is in itself a difficult global optimization problem, whose local optima, frequently large in number, need not be globally optimal. Indeed, this is due to the fact that the feasible region of Q is, in general, a nonconvex set. In this paper we present a monotonically increasing algorithm that finds an exact, globally-optimal solution for Q. Our approach does not require any hypothesis on the boundedness of neither the efficient set EP nor the optimal objective value. The proposed algorithm relies on a simplified disjoint bilinear program that can be solved through the use of well-known specifically designed methods within nonconvex optimization. The algorithm has been implemented in C and preliminary numerical results are reported. [PUBLICATION ABSTRACT]
Author Jorge, Jesús M.
Author_xml – sequence: 1
  givenname: Jesús M.
  surname: Jorge
  fullname: Jorge, Jesús M.
BookMark eNp9kD1PwzAURS1UJErhB7BZ7IFnO4njsSC-pKIiAbPlJM-tqyQujosEC3-dRIWFgend4dz7pHNMJp3vkJAzBhcMQF72DApVJAAiEbJIE3lApiyTIuGK5RMyBcWzJANgR-S47zcAoIqMT8nXnF65xnVoAp03Kx9cXLfU-kCX2-ha9-m6FTV0sSdud10Vne-of8dA4xrpjbWucthF-oyRejuwj7smum2DdFlucMDf8bf-FPwqmLYdN4dcNtiekENrmh5Pf-6MvN7evFzfJ4vl3cP1fJFUXPKYFCpVyLgRZWqLssww58gqVZasqiWHrEaooWa1SYUVlqtcQFFlA1RahSikmJHz_e42-Lcd9lFv_C50w0vNVJrnMgc2QGwPVcH3fUCrt8G1JnxoBnrUrPea9aBZj5r1OCz_dCoXzSgpBuOaf5rfeWeFFQ
CitedBy_id crossref_primary_10_1016_j_cor_2018_10_009
crossref_primary_10_1111_itor_12627
crossref_primary_10_1007_s10957_008_9467_2
crossref_primary_10_4000_etudescaribeennes_16333
crossref_primary_10_1080_10556788_2024_2380688
crossref_primary_10_1111_itor_13202
crossref_primary_10_1016_j_ejor_2008_02_005
crossref_primary_10_1016_j_ejor_2008_10_003
crossref_primary_10_1111_itor_13547
crossref_primary_10_1007_s10479_020_03820_4
crossref_primary_10_1080_02331930903500290
crossref_primary_10_18187_pjsor_v18i1_3261
Cites_doi 10.1007/BFb0121041
10.1016/0167-6377(91)90026-L
10.1007/BF00940077
10.1016/0377-2217(88)90257-3
10.1016/0022-247X(75)90189-4
10.1007/978-3-662-03199-5
10.1002/1520-6750(199302)40:1<103::AID-NAV3220400107>3.0.CO;2-A
10.1007/BF02196590
10.1007/BF01100242
10.1007/PL00011428
10.1007/BF00120667
10.1515/9781400873173
10.1016/S0167-6377(02)00216-X
10.1016/0022-247X(84)90269-5
10.1287/opre.48.1.65.12449
10.1007/s101070050072
10.1007/BF01580111
10.1007/BF02192023
10.1007/BF02207641
10.1007/BF01584543
10.1007/BF01580453
ContentType Journal Article
Copyright Springer 2005
Copyright_xml – notice: Springer 2005
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-003-3784-7
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ABI/INFORM Collection (ProQuest)
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)
Research Library (Alumni)
ProQuest MSED
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Business Premium Collection
ProQuest Technology Collection
ProQuest One
ProQuest Central Korea
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
ProQuest Research Library
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)
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Business
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest 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
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Sciences (General)
EISSN 1573-2916
EndPage 16
ExternalDocumentID 841259861
10_1007_s10898_003_3784_7
Genre Feature
GroupedDBID -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
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
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAPKM
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYXX
ABAKF
ABBBX
ABBRH
ABBXA
ABDBE
ABDZT
ABECU
ABFSG
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABRTQ
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACGOD
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSTC
ACZOJ
ADHHG
ADHIR
ADHKG
ADIMF
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AETLH
AEVLU
AEXYK
AEZWR
AFBBN
AFDZB
AFEXP
AFFHD
AFGCZ
AFHIU
AFKRA
AFLOW
AFOHR
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGQPQ
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHPBZ
AHSBF
AHWEU
AHYZX
AI.
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AIXLP
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMVHM
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARCSS
ARMRJ
ASPBG
ATHPR
AVWKF
AXYYD
AYFIA
AYQZM
AZFZN
AZQEC
B-.
BA0
BAPOH
BBWZM
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
CAG
CCPQU
CITATION
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
GQ7
GQ8
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
M2O
M2P
M4Y
M7S
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P62
P9M
PF0
PHGZM
PHGZT
PQBIZ
PQBZA
PQGLB
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
ZMTXR
ZWQNP
ZY4
~EX
3V.
7SC
7XB
8AL
8FD
8FK
AESKC
JQ2
L.-
L.0
L7M
L~C
L~D
M0N
MBDVC
PKEHL
PQEST
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c272t-8949e12a3b4f8bb5e62e1c9bb1cd7205de0d0d1da43f3f296308c562ebf9ee373
IEDL.DBID M2P
ISICitedReferencesCount 19
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000228854700001&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 16:44:27 EST 2025
Sat Nov 29 01:59:26 EST 2025
Tue Nov 18 22:15:14 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c272t-8949e12a3b4f8bb5e62e1c9bb1cd7205de0d0d1da43f3f296308c562ebf9ee373
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 194667601
PQPubID 29930
PageCount 16
ParticipantIDs proquest_journals_194667601
crossref_primary_10_1007_s10898_003_3784_7
crossref_citationtrail_10_1007_s10898_003_3784_7
PublicationCentury 2000
PublicationDate 2005-01-00
20050101
PublicationDateYYYYMMDD 2005-01-01
PublicationDate_xml – month: 01
  year: 2005
  text: 2005-01-00
PublicationDecade 2000
PublicationPlace Dordrecht
PublicationPlace_xml – name: Dordrecht
PublicationTitle Journal of global optimization
PublicationYear 2005
Publisher Springer Nature B.V
Publisher_xml – name: Springer Nature B.V
References H. Benson (3784_CR3) 1984; 98
3784_CR17
H. Benson (3784_CR8) 1996; 88
3784_CR18
S. Alarie (3784_CR1) 2001; 90
J. Ecker (3784_CR11) 1975; 8
3784_CR14
J. Philip (3784_CR20) 1972; 2
H. Benson (3784_CR5) 1991; 10
H. Benson (3784_CR10) 1994; 80
C. Audet (3784_CR2) 1999; 85
J. Ecker (3784_CR12) 1994; 83
J. Evans (3784_CR13) 1973; 5
S. Sayin (3784_CR22) 2000; 48
H. Isermann (3784_CR15) 1987; 33
H. Benson. (3784_CR7) 1993; 3
P. Yu (3784_CR24) 1975; 49
3784_CR23
H. Benson (3784_CR4) 1991; 1
K. Murty (3784_CR19) 1985; 24
3784_CR21
H. Benson (3784_CR6) 1992; 73
H. Benson (3784_CR9) 1993; 40
J. Jorge (3784_CR16) 2003; 31
References_xml – volume: 24
  start-page: 30
  year: 1985
  ident: 3784_CR19
  publication-title: Mathematical Programming Study.
  doi: 10.1007/BFb0121041
– volume: 10
  start-page: 481
  year: 1991
  ident: 3784_CR5
  publication-title: Operations Research Letters.
  doi: 10.1016/0167-6377(91)90026-L
– volume: 73
  start-page: 47
  issue: 1
  year: 1992
  ident: 3784_CR6
  publication-title: Journal of Optimization Theory and Applications.
  doi: 10.1007/BF00940077
– volume: 33
  start-page: 91
  year: 1987
  ident: 3784_CR15
  publication-title: European Journal of Operational Research.
  doi: 10.1016/0377-2217(88)90257-3
– volume: 49
  start-page: 430
  year: 1975
  ident: 3784_CR24
  publication-title: Journal of Mathematical Analysis and Applications.
  doi: 10.1016/0022-247X(75)90189-4
– ident: 3784_CR14
  doi: 10.1007/978-3-662-03199-5
– volume: 40
  start-page: 103
  year: 1993
  ident: 3784_CR9
  publication-title: Naval Research Logistics.
  doi: 10.1002/1520-6750(199302)40:1<103::AID-NAV3220400107>3.0.CO;2-A
– ident: 3784_CR17
– ident: 3784_CR18
– volume: 80
  start-page: 3
  issue: 1
  year: 1994
  ident: 3784_CR10
  publication-title: Journal of Optimization Theory and Applications.
  doi: 10.1007/BF02196590
– volume: 3
  start-page: 95
  year: 1993
  ident: 3784_CR7
  publication-title: Journal of Global Optimization.
  doi: 10.1007/BF01100242
– volume: 90
  start-page: 373
  year: 2001
  ident: 3784_CR1
  publication-title: Mathematical Programming.
  doi: 10.1007/PL00011428
– volume: 1
  start-page: 83
  year: 1991
  ident: 3784_CR4
  publication-title: Journal of Global Optimization.
  doi: 10.1007/BF00120667
– ident: 3784_CR21
  doi: 10.1515/9781400873173
– volume: 31
  start-page: 124
  year: 2003
  ident: 3784_CR16
  publication-title: Operations Research Letters.
  doi: 10.1016/S0167-6377(02)00216-X
– volume: 98
  start-page: 562
  year: 1984
  ident: 3784_CR3
  publication-title: Journal of Mathematical Analysis and Applications.
  doi: 10.1016/0022-247X(84)90269-5
– volume: 48
  start-page: 65
  year: 2000
  ident: 3784_CR22
  publication-title: Operations Research.
  doi: 10.1287/opre.48.1.65.12449
– volume: 85
  start-page: 573
  year: 1999
  ident: 3784_CR2
  publication-title: Mathematical Programming.
  doi: 10.1007/s101070050072
– volume: 5
  start-page: 54
  year: 1973
  ident: 3784_CR13
  publication-title: Mathematical Programming.
  doi: 10.1007/BF01580111
– volume: 88
  start-page: 77
  issue: 1
  year: 1996
  ident: 3784_CR8
  publication-title: Journal of Optimization Theory and Applications.
  doi: 10.1007/BF02192023
– volume: 83
  start-page: 541
  issue: 3
  year: 1994
  ident: 3784_CR12
  publication-title: Journal of Optimization Theory and Applications.
  doi: 10.1007/BF02207641
– volume: 2
  start-page: 207
  year: 1972
  ident: 3784_CR20
  publication-title: Mathematical Programming.
  doi: 10.1007/BF01584543
– volume: 8
  start-page: 375
  year: 1975
  ident: 3784_CR11
  publication-title: Mathematical Programming.
  doi: 10.1007/BF01580453
– ident: 3784_CR23
SSID ssj0009852
Score 1.7897755
Snippet The problem Q of optimizing a linear function over the efficient set of a multiple objective linear program serves several useful purposes in multiple criteria...
SourceID proquest
crossref
SourceType Aggregation Database
Enrichment Source
Index Database
StartPage 1
SubjectTerms Algorithms
Hypotheses
Linear programming
Optimization
Optimization algorithms
Studies
Title A Bilinear Algorithm for Optimizing a Linear Function over the Efficient Set of a Multiple Objective Linear Programming Problem
URI https://www.proquest.com/docview/194667601
Volume 31
WOSCitedRecordID wos000228854700001&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 (ProQuest)
  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
  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: ProQuest 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: SpringerLINK Contemporary 1997-Present
  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/eLvHCXMwpV1Lb9QwEB7RlgMcKC0gSh_ygQMgWSROvE5OaFvtCgl2N-ryKFyi-AWLurtlN3Dgwl_vTOK09NILijRSFNuyNPE3n-zxNwDPVSal0D7leU9ansYOcTC1SOTSxHuvNaJm1RSbUONxdnaWFyE3Zx3SKjtMbIDaLg3tkb-OSQidEjjeXPzkVDSKDldDBY0N2EJiE1NG10gU15q7WVNwJ8qF5BLhuDvUbG_OZXS3jC6XqSzl6mZYuonKTagZbv_nJB_Cg8AxWb_9KXbgjlvswv1_lAd3YSes6TV7EYSnXz6Cv312PCPaWa1Y__wbjlx_nzNktWyCwDKf_cGurGLv2xZDjIjkVUZJoAx5JBs0chQYxdjU1Wzpse0o5Cuyif7RQmvXvWgTw-Y0ZtFWtXkMH4eDDydveSjQwI1QouZZnuYuFlWiU59pLV1PuNjkWsfGKhFJ6yIb2dhW6PjEC1zrUWaQcDntc-cSlTyBzcVy4Z4Cs0hMnYmdkalNrTQ5Pp70zqSKfE_39iDq_FOaoF5ORTTOy2vdZXIpaZ2W5NJS7cGrqy4XrXTHbY33O4-WYRWvyyt3Prv16z7cawRdm42ZA9isV7_cIdw1v-vZenUEG-rzlyPYOh6Mi1N8e6c42lF0QlZMGluQVVO0hfyK9nT66RKcJfE6
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LTxRBEK4gmKgHEISIKPZBEzGZONPTvT1zIGYFNhCWZRMh4TZOv3QNu4u7A0Qv_CL_o1Xz4HHhxsHMcbo7M93ffFXTXfUVwDuVSMm1F0HakjYQkUMeFBYdORF777VG1szLYhOq10tOTtL-DPxtcmEorLLhxJKo7djQHvmniITQKYDj89mvgIpG0eFqU0GjQsW--32Jf2zTzb1tXN73nHd2jrZ2g7qoQGC44kWQpCJ1Ec9jLXyitXQt7iKTah0Zq3gorQttaCOb48PGniM-w8Sgk-C0T52LVYzjPoI5QcJiFCnI-zcav0lZ4CdMuQwk0n9ziFpl6iWUy0bJbCoRgbprBu9agdK0dRb-s0l5DvO1D83aFegXYcaNluDZLWXFJVisOWvKPtTC2hsv4KrNvgzIrc4nrH36Hd-k-DFk6LWzQyTO4eAPdmU561YtOmjxCbWMglwZ-slsp5TbQCvNvrqCjT22PajjMdmh_lmZjqZ7vwp8G9KY_apqzzIcP8i0rMDsaDxyL4FZdLydiZyRwgorTYqXJz03qULf0q1VCBs8ZKZWZ6ciIafZja40QYi0XDOCUKZW4eN1l7NKmuS-xmsNgrKapabZNXxe3Xv3LTzZPTroZt293v4aPC3Fa8tNqNcwW0zO3Rt4bC6KwXSyXn4PDL49NNb-ASZgRzQ
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3NT9RAFH9BMAYPIAjhQ3EOmqhJQzud2WkPxqzARgIuTdSEeKmdL1jD7sJulejFv8v_zvf6AXLhxsH02JlJO_3Ne7_OvPd7AM9VIiXXXgRpR9pARA7toLBI5ETsvdcarWZRFZtQ_X5yfJxmM_CnzYWhsMrWJlaG2o4N7ZFvRySETgEc276Jish2e2_PLwIqIEUHrW01jRohB-7nJf69Td_s7-KnfsF5b-_TzvugKTAQGK54GSSpSF3Ei1gLn2gtXYe7yKRaR8YqHkrrQhvayBb44LHniNUwMUgYnPapc7GKcdx7MKfwF5OiCTP55VrvN6mK_YQpl4FEV9AeqNZZewnltVFim0pEoG66xJseoXJzvcX_eIIewULDrVm3XgxLMONGy_DwH8XFZVhqbNmUvWwEt189ht9d9m5AdLuYsO7ZCb5JeTpkyObZERrU4eAXdmUFO6xb9JAJEJoZBb8y5M9sr5LhQO_NPrqSjT22_dDEabIj_a12KW33rA6IG9KYWV3NZwU-38m0rMLsaDxya8AsEnJnImeksMJKk-LlSedNqtB3dGcdwhYbuWlU26l4yFl-rTdNcCKN15zglKt1eH3V5byWLLmt8WaLpryxXtP8Ckobt959Bg8QYvnhfv9gE-YrTdtqb-oJzJaT7-4p3Dc_ysF0slUtDQZf7xpqfwFjAVAg
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=A+Bilinear+Algorithm+for+Optimizing+a+Linear+Function+over+the+Efficient+Set+of+a+Multiple+Objective+Linear+Programming+Problem&rft.jtitle=Journal+of+global+optimization&rft.au=Jorge%2C+Jes%C3%BAs+M.&rft.date=2005-01-01&rft.issn=0925-5001&rft.eissn=1573-2916&rft.volume=31&rft.issue=1&rft.spage=1&rft.epage=16&rft_id=info:doi/10.1007%2Fs10898-003-3784-7&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s10898_003_3784_7
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