A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem

•Deterministic bounding procedure (DBP) for a class of mixed-integer BL problems.•Convergent upper and lower bounds for the BL problem are computed.•New formulations of the subproblems in DBP for demanding BL problems.•Application in the optimization of dynamic electricity tariffs.•Comparison of DBP...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research Vol. 291; no. 1; pp. 52 - 66
Main Authors: Soares, Inês, Alves, Maria João, Henggeler Antunes, Carlos
Format: Journal Article
Language:English
Published: Elsevier B.V 16.05.2021
Subjects:
ISSN:0377-2217, 1872-6860
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract •Deterministic bounding procedure (DBP) for a class of mixed-integer BL problems.•Convergent upper and lower bounds for the BL problem are computed.•New formulations of the subproblems in DBP for demanding BL problems.•Application in the optimization of dynamic electricity tariffs.•Comparison of DBP with previously developed hybrid approaches. In this paper, a deterministic bounding procedure for the global optimization of a mixed-integer bi-level programming problem is proposed. The aim has been to develop an efficient algorithm to deal with a case study in the electricity retail market. In this problem, an electricity retailer wants to define a time-of-use tariff structure to maximize profits, but he has to take into account the consumers’ reaction by means of re-scheduling appliance operation to minimize costs. The problem has been formulated as a bi-level mixed-integer programming model. The algorithm we propose uses optimal-value-function reformulations based on similar principles as the ones that have been used by other authors, which are adapted to the characteristics of this type of (pricing optimization) problems where no upper (lower) level variables appear in the lower (upper) level constraints. The overall strategy consists of generating a series of convergent upper bounds and lower bounds for the upper-level objective function until the difference between these bounds is below a given threshold. Computational results are presented as well as a comparison with a hybrid approach combining a particle swarm optimization algorithm to deal with the upper-level problem and an exact solver to tackle the lower-level problem, which we have previously developed to address a similar case study. When the lower-level model is difficult, a significant relative MIP gap is unavoidable when solving the algorithm's subproblems. Novel reformulations of those subproblems using “elastic” variables are proposed trying to obtain meaningful lower/upper bounds within an acceptable computational time.
AbstractList •Deterministic bounding procedure (DBP) for a class of mixed-integer BL problems.•Convergent upper and lower bounds for the BL problem are computed.•New formulations of the subproblems in DBP for demanding BL problems.•Application in the optimization of dynamic electricity tariffs.•Comparison of DBP with previously developed hybrid approaches. In this paper, a deterministic bounding procedure for the global optimization of a mixed-integer bi-level programming problem is proposed. The aim has been to develop an efficient algorithm to deal with a case study in the electricity retail market. In this problem, an electricity retailer wants to define a time-of-use tariff structure to maximize profits, but he has to take into account the consumers’ reaction by means of re-scheduling appliance operation to minimize costs. The problem has been formulated as a bi-level mixed-integer programming model. The algorithm we propose uses optimal-value-function reformulations based on similar principles as the ones that have been used by other authors, which are adapted to the characteristics of this type of (pricing optimization) problems where no upper (lower) level variables appear in the lower (upper) level constraints. The overall strategy consists of generating a series of convergent upper bounds and lower bounds for the upper-level objective function until the difference between these bounds is below a given threshold. Computational results are presented as well as a comparison with a hybrid approach combining a particle swarm optimization algorithm to deal with the upper-level problem and an exact solver to tackle the lower-level problem, which we have previously developed to address a similar case study. When the lower-level model is difficult, a significant relative MIP gap is unavoidable when solving the algorithm's subproblems. Novel reformulations of those subproblems using “elastic” variables are proposed trying to obtain meaningful lower/upper bounds within an acceptable computational time.
Author Soares, Inês
Henggeler Antunes, Carlos
Alves, Maria João
Author_xml – sequence: 1
  givenname: Inês
  orcidid: 0000-0001-7146-4273
  surname: Soares
  fullname: Soares, Inês
  email: inesgsoares@deec.uc.pt
  organization: INESC Coimbra, DEEC, Rua Sílvio Lima, Pólo II, Coimbra 3030-290, Portugal
– sequence: 2
  givenname: Maria João
  surname: Alves
  fullname: Alves, Maria João
  email: mjalves@fe.uc.pt
  organization: INESC Coimbra, DEEC, Rua Sílvio Lima, Pólo II, Coimbra 3030-290, Portugal
– sequence: 3
  givenname: Carlos
  surname: Henggeler Antunes
  fullname: Henggeler Antunes, Carlos
  email: ch@deec.uc.pt
  organization: INESC Coimbra, DEEC, Rua Sílvio Lima, Pólo II, Coimbra 3030-290, Portugal
BookMark eNp9kMtOwzAQRS1UJNrCD7DyDyTYzsOpxKaqeEmV2MDa8mNSJkriynEr4OtJKCsWXc1mztW9Z0Fmve-BkFvOUs54edek0PiQCiZYylYp48UFmfNKiqSsSjYjc5ZJmQjB5RVZDEPD2PjCizkxa-ogQuiwxyGipcYfeof9ju6Dt-AOAWjtA40fQHetN7qlfh-xw28d0ffU11RTg0kLR2hph5_gEuwj7CBMCaaF7ppc1rod4ObvLsn748Pb5jnZvj69bNbbxOZsFZNcg611ISTkRlemKpzVIhMVVKvSWla4cYHMSjB5nWcF1MZIAXkumeO1LKzLlqQ65drghyFArSzG35YxaGwVZ2pypRo1uVKTK8VWahQxouIfug_Y6fB1Hro_QTCOOiIENViEfpSGAWxUzuM5_Afql4fh
CitedBy_id crossref_primary_10_1155_2021_8868291
crossref_primary_10_1016_j_eswa_2024_124666
crossref_primary_10_1016_j_energy_2024_132497
crossref_primary_10_1007_s00500_022_07038_3
crossref_primary_10_1016_j_tre_2025_104148
crossref_primary_10_1016_j_energy_2022_125293
crossref_primary_10_1016_j_asoc_2025_112764
crossref_primary_10_1049_rpg2_13083
crossref_primary_10_1016_j_ejor_2023_01_029
crossref_primary_10_1016_j_cor_2023_106195
crossref_primary_10_1007_s40808_024_02207_9
crossref_primary_10_1016_j_ijepes_2023_109354
crossref_primary_10_1016_j_ejor_2023_05_036
Cites_doi 10.1016/j.ijepes.2016.02.029
10.1287/opre.2017.1650
10.1007/978-3-319-31204-0_30
10.1007/BF02275351
10.1287/opre.2017.1589
10.1287/opre.38.5.911
10.1016/j.ejor.2019.03.005
10.1016/j.amc.2005.11.134
10.1007/s10898-009-9479-y
10.1007/BF01580665
10.1016/j.omega.2019.01.005
10.1016/j.cor.2013.07.016
10.1007/s10287-005-0025-1
10.1016/j.eneco.2012.12.010
10.1007/s11590-015-0872-9
10.1016/j.compchemeng.2014.06.004
10.1007/s10898-007-9260-z
ContentType Journal Article
Copyright 2020 Elsevier B.V.
Copyright_xml – notice: 2020 Elsevier B.V.
DBID AAYXX
CITATION
DOI 10.1016/j.ejor.2020.09.015
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Business
EISSN 1872-6860
EndPage 66
ExternalDocumentID 10_1016_j_ejor_2020_09_015
S0377221720308018
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
4.4
457
4G.
5GY
5VS
6OB
7-5
71M
8P~
9JN
9JO
AAAKF
AABNK
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AARIN
AAXUO
AAYFN
ABAOU
ABBOA
ABFNM
ABFRF
ABJNI
ABMAC
ABUCO
ABYKQ
ACAZW
ACDAQ
ACGFO
ACGFS
ACIWK
ACNCT
ACRLP
ACZNC
ADBBV
ADEZE
ADGUI
AEBSH
AEFWE
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIGVJ
AIKHN
AITUG
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
APLSM
ARUGR
AXJTR
BKOJK
BKOMP
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EO8
EO9
EP2
EP3
F5P
FDB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HAMUX
IHE
J1W
KOM
LY1
M41
MHUIS
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
ROL
RPZ
RXW
SCC
SDF
SDG
SDP
SDS
SES
SPC
SPCBC
SSB
SSD
SSV
SSW
SSZ
T5K
TAE
TN5
U5U
XPP
ZMT
~02
~G-
1OL
29G
41~
9DU
AAAKG
AAQXK
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ABXDB
ACLOT
ACNNM
ACRPL
ACVFH
ADCNI
ADIYS
ADJOM
ADMUD
ADNMO
ADXHL
AEIPS
AEUPX
AFFNX
AFJKZ
AFPUW
AGQPQ
AI.
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
ASPBG
AVWKF
AZFZN
CITATION
EFKBS
EJD
FEDTE
FGOYB
HVGLF
HZ~
R2-
SEW
VH1
WUQ
~HD
ID FETCH-LOGICAL-c409t-4aecfa527e4ba8b85dca2328e896cc05d377736eb4f435efbb72e4470d1f75cd3
ISICitedReferencesCount 20
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000608619800004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0377-2217
IngestDate Sat Nov 29 07:22:37 EST 2025
Tue Nov 18 22:37:51 EST 2025
Fri Feb 23 02:47:59 EST 2024
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Global optimization
Bi-level optimization
Electricity retail market
Pricing problem
Demand response
Dynamic tariffs
Mixed-integer linear programming model
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c409t-4aecfa527e4ba8b85dca2328e896cc05d377736eb4f435efbb72e4470d1f75cd3
ORCID 0000-0001-7146-4273
OpenAccessLink http://hdl.handle.net/10316/94373
PageCount 15
ParticipantIDs crossref_citationtrail_10_1016_j_ejor_2020_09_015
crossref_primary_10_1016_j_ejor_2020_09_015
elsevier_sciencedirect_doi_10_1016_j_ejor_2020_09_015
PublicationCentury 2000
PublicationDate 2021-05-16
PublicationDateYYYYMMDD 2021-05-16
PublicationDate_xml – month: 05
  year: 2021
  text: 2021-05-16
  day: 16
PublicationDecade 2020
PublicationTitle European journal of operational research
PublicationYear 2021
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Caramia, Mari (bib0003) 2015; 9
Kleniati, Adjiman (bib0008) 2015; 72
Soares, Alves, Antunes (bib0017) 2020; 93
Meng, Zeng (bib0011) 2013
Moore, Bard (bib0015) 1990; 38
Lozano, Smith (bib0009) 2017; 65
Mitsos (bib0013) 2010; 47
Mitsos, Lemonidis, Barton (bib0014) 2008; 42
Aussel, Brotcorne, Lepaul, von Niederhäusern (bib0002) 2020; 281
Zeng, An (bib0020) 2014
Zugno, Morales, Pinson, Madsen (bib0021) 2013; 36
Sekizaki, Nishizaki, Hayashida (bib0016) 2016; 81
Fischetti, Ljubić, Monaci, Sinnl (bib0006) 2017; 65
Gümüş, Floudas (bib0007) 2005; 2
McCormick (bib0010) 1976; 10
Fischetti, Ljubić, Monaci, Sinnl (bib0005) 2016
DeNegre, Ralphs (bib0004) 2009
Vicente, Savard, Judice (bib0018) 1996; 89
Mersha, Dempe (bib0012) 2006; 180
Alves, Antunes, Carrasqueira (bib0001) 2016
Xu, Wang (bib0019) 2014; 41
Caramia (10.1016/j.ejor.2020.09.015_bib0003) 2015; 9
Xu (10.1016/j.ejor.2020.09.015_bib0019) 2014; 41
Fischetti (10.1016/j.ejor.2020.09.015_bib0006) 2017; 65
Alves (10.1016/j.ejor.2020.09.015_bib0001) 2016
Mersha (10.1016/j.ejor.2020.09.015_bib0012) 2006; 180
Fischetti (10.1016/j.ejor.2020.09.015_bib0005) 2016
Mitsos (10.1016/j.ejor.2020.09.015_bib0013) 2010; 47
Meng (10.1016/j.ejor.2020.09.015_bib0011) 2013
Zeng (10.1016/j.ejor.2020.09.015_bib0020) 2014
McCormick (10.1016/j.ejor.2020.09.015_bib0010) 1976; 10
Mitsos (10.1016/j.ejor.2020.09.015_bib0014) 2008; 42
Soares (10.1016/j.ejor.2020.09.015_bib0017) 2020; 93
Lozano (10.1016/j.ejor.2020.09.015_bib0009) 2017; 65
Zugno (10.1016/j.ejor.2020.09.015_bib0021) 2013; 36
DeNegre (10.1016/j.ejor.2020.09.015_bib0004) 2009
Gümüş (10.1016/j.ejor.2020.09.015_bib0007) 2005; 2
Vicente (10.1016/j.ejor.2020.09.015_bib0018) 1996; 89
Sekizaki (10.1016/j.ejor.2020.09.015_bib0016) 2016; 81
Moore (10.1016/j.ejor.2020.09.015_bib0015) 1990; 38
Kleniati (10.1016/j.ejor.2020.09.015_bib0008) 2015; 72
Aussel (10.1016/j.ejor.2020.09.015_bib0002) 2020; 281
References_xml – volume: 81
  start-page: 371
  year: 2016
  end-page: 386
  ident: bib0016
  article-title: "Electricity retail market model with flexible price settings and elastic price-based demand responses by consumers in distribution network
  publication-title: International Journal of Electrical Power & Energy Systems
– volume: 65
  start-page: 768
  year: 2017
  end-page: 786
  ident: bib0009
  article-title: "A value-function-based exact approach for the bilevel mixed-integer programming problem
  publication-title: Operations Research
– volume: 42
  start-page: 475
  year: 2008
  end-page: 513
  ident: bib0014
  article-title: "Global solution of bilevel programs with a nonconvex inner program
  publication-title: Journal of Global Optimization
– volume: 47
  start-page: 557
  year: 2010
  end-page: 582
  ident: bib0013
  article-title: "Global solution of nonlinear mixed-integer bilevel programs
  publication-title: Journal of Global Optimization
– volume: 10
  start-page: 147
  year: 1976
  end-page: 175
  ident: bib0010
  article-title: “Computability of global solutions to factorable nonconvex programs: Part I - convex underestimating problems
  publication-title: Mathematical Programming
– start-page: 81
  year: 2013
  end-page: 88
  ident: bib0011
  article-title: "An Optimal Real-time Pricing Algorithm for the Smart Grid: A Bi-level Programming Approach
  publication-title: Proceedings of the Imperial College Computing Student Workshop (ICCSW’13) - OpenAccess Series in Informatics
– volume: 41
  start-page: 309
  year: 2014
  end-page: 318
  ident: bib0019
  article-title: "An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
  publication-title: Computers & Operations Research
– volume: 2
  start-page: 181
  year: 2005
  end-page: 212
  ident: bib0007
  article-title: "Global optimization of mixed-integer bilevel programming problems
  publication-title: Computational Management Science
– start-page: 77
  year: 2016
  end-page: 88
  ident: bib0005
  article-title: "Intersection cuts for bilevel optimization
  publication-title: Integer Programming and Combinatorial Optimization
– start-page: 459
  year: 2016
  end-page: 474
  ident: bib0001
  article-title: "A hybrid genetic algorithm for the interaction of electricity retailers with demand response
  publication-title: Applications of Evolutionary Computation
– volume: 65
  start-page: 1615
  year: 2017
  end-page: 1637
  ident: bib0006
  article-title: "A new general-purpose algorithm for mixed-integer bilevel linear programs
  publication-title: Operations Research
– volume: 72
  start-page: 373
  year: 2015
  end-page: 386
  ident: bib0008
  article-title: "A generalization of the branch-and-sandwich algorithm: from continuous to mixed-integer nonlinear bilevel problems
  publication-title: Computers & Chemical Engineering
– volume: 89
  start-page: 597
  year: 1996
  end-page: 614
  ident: bib0018
  article-title: Discrete linear bilevel programming problem
  publication-title: Journal of Optimization Theory and Applications
– start-page: 1
  year: 2014
  end-page: 34
  ident: bib0020
  article-title: "Solving bilevel mixed integer program by reformulations and decomposition
  publication-title: Optimization Online
– volume: 9
  start-page: 1447
  year: 2015
  end-page: 1468
  ident: bib0003
  article-title: "Enhanced exact algorithms for discrete bilevel linear problems
  publication-title: Optimization Letters
– volume: 180
  start-page: 247
  year: 2006
  end-page: 254
  ident: bib0012
  article-title: "Linear bilevel programming with upper level constraints depending on the lower level solution
  publication-title: Applied Mathematics and Computation
– volume: 36
  start-page: 182
  year: 2013
  end-page: 197
  ident: bib0021
  article-title: "A bilevel model for electricity retailers' participation in a demand response market environment
  publication-title: Energy Economics
– volume: 281
  start-page: 299
  year: 2020
  end-page: 315
  ident: bib0002
  article-title: "A trilevel model for best response in energy demand-side management
  publication-title: European Journal of Operational Research
– volume: 93
  year: 2020
  ident: bib0017
  article-title: "Designing time-of-use tariffs in electricity retail markets using a bi-level model – estimating bounds when the lower level problem cannot be exactly solved
  publication-title: Omega
– volume: 38
  start-page: 911
  year: 1990
  end-page: 921
  ident: bib0015
  article-title: "The mixed integer linear bilevel programming problem
  publication-title: Operations Research
– start-page: 65
  year: 2009
  end-page: 78
  ident: bib0004
  article-title: "A Branch-and-cut algorithm for integer bilevel linear programs
  publication-title: Operations research and cyber-infrastructure
– volume: 81
  start-page: 371
  year: 2016
  ident: 10.1016/j.ejor.2020.09.015_bib0016
  article-title: "Electricity retail market model with flexible price settings and elastic price-based demand responses by consumers in distribution network
  publication-title: International Journal of Electrical Power & Energy Systems
  doi: 10.1016/j.ijepes.2016.02.029
– volume: 65
  start-page: 1615
  issue: 6
  year: 2017
  ident: 10.1016/j.ejor.2020.09.015_bib0006
  article-title: "A new general-purpose algorithm for mixed-integer bilevel linear programs
  publication-title: Operations Research
  doi: 10.1287/opre.2017.1650
– start-page: 459
  year: 2016
  ident: 10.1016/j.ejor.2020.09.015_bib0001
  article-title: "A hybrid genetic algorithm for the interaction of electricity retailers with demand response
  publication-title: Applications of Evolutionary Computation
  doi: 10.1007/978-3-319-31204-0_30
– start-page: 1
  year: 2014
  ident: 10.1016/j.ejor.2020.09.015_bib0020
  article-title: "Solving bilevel mixed integer program by reformulations and decomposition
  publication-title: Optimization Online
– volume: 89
  start-page: 597
  issue: 3
  year: 1996
  ident: 10.1016/j.ejor.2020.09.015_bib0018
  article-title: Discrete linear bilevel programming problem
  publication-title: Journal of Optimization Theory and Applications
  doi: 10.1007/BF02275351
– start-page: 65
  year: 2009
  ident: 10.1016/j.ejor.2020.09.015_bib0004
  article-title: "A Branch-and-cut algorithm for integer bilevel linear programs
– volume: 65
  start-page: 768
  issue: 3
  year: 2017
  ident: 10.1016/j.ejor.2020.09.015_bib0009
  article-title: "A value-function-based exact approach for the bilevel mixed-integer programming problem
  publication-title: Operations Research
  doi: 10.1287/opre.2017.1589
– volume: 38
  start-page: 911
  issue: 5
  year: 1990
  ident: 10.1016/j.ejor.2020.09.015_bib0015
  article-title: "The mixed integer linear bilevel programming problem
  publication-title: Operations Research
  doi: 10.1287/opre.38.5.911
– volume: 281
  start-page: 299
  issue: 2
  year: 2020
  ident: 10.1016/j.ejor.2020.09.015_bib0002
  article-title: "A trilevel model for best response in energy demand-side management
  publication-title: European Journal of Operational Research
  doi: 10.1016/j.ejor.2019.03.005
– volume: 180
  start-page: 247
  issue: 1
  year: 2006
  ident: 10.1016/j.ejor.2020.09.015_bib0012
  article-title: "Linear bilevel programming with upper level constraints depending on the lower level solution
  publication-title: Applied Mathematics and Computation
  doi: 10.1016/j.amc.2005.11.134
– volume: 47
  start-page: 557
  issue: 4
  year: 2010
  ident: 10.1016/j.ejor.2020.09.015_bib0013
  article-title: "Global solution of nonlinear mixed-integer bilevel programs
  publication-title: Journal of Global Optimization
  doi: 10.1007/s10898-009-9479-y
– volume: 10
  start-page: 147
  issue: 1
  year: 1976
  ident: 10.1016/j.ejor.2020.09.015_bib0010
  article-title: “Computability of global solutions to factorable nonconvex programs: Part I - convex underestimating problems
  publication-title: Mathematical Programming
  doi: 10.1007/BF01580665
– volume: 93
  year: 2020
  ident: 10.1016/j.ejor.2020.09.015_bib0017
  article-title: "Designing time-of-use tariffs in electricity retail markets using a bi-level model – estimating bounds when the lower level problem cannot be exactly solved
  publication-title: Omega
  doi: 10.1016/j.omega.2019.01.005
– volume: 41
  start-page: 309
  year: 2014
  ident: 10.1016/j.ejor.2020.09.015_bib0019
  article-title: "An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
  publication-title: Computers & Operations Research
  doi: 10.1016/j.cor.2013.07.016
– volume: 2
  start-page: 181
  issue: 3
  year: 2005
  ident: 10.1016/j.ejor.2020.09.015_bib0007
  article-title: "Global optimization of mixed-integer bilevel programming problems
  publication-title: Computational Management Science
  doi: 10.1007/s10287-005-0025-1
– volume: 36
  start-page: 182
  year: 2013
  ident: 10.1016/j.ejor.2020.09.015_bib0021
  article-title: "A bilevel model for electricity retailers' participation in a demand response market environment
  publication-title: Energy Economics
  doi: 10.1016/j.eneco.2012.12.010
– start-page: 77
  year: 2016
  ident: 10.1016/j.ejor.2020.09.015_bib0005
  article-title: "Intersection cuts for bilevel optimization
  publication-title: Integer Programming and Combinatorial Optimization
– volume: 9
  start-page: 1447
  issue: 7
  year: 2015
  ident: 10.1016/j.ejor.2020.09.015_bib0003
  article-title: "Enhanced exact algorithms for discrete bilevel linear problems
  publication-title: Optimization Letters
  doi: 10.1007/s11590-015-0872-9
– volume: 72
  start-page: 373
  year: 2015
  ident: 10.1016/j.ejor.2020.09.015_bib0008
  article-title: "A generalization of the branch-and-sandwich algorithm: from continuous to mixed-integer nonlinear bilevel problems
  publication-title: Computers & Chemical Engineering
  doi: 10.1016/j.compchemeng.2014.06.004
– start-page: 81
  year: 2013
  ident: 10.1016/j.ejor.2020.09.015_bib0011
  article-title: "An Optimal Real-time Pricing Algorithm for the Smart Grid: A Bi-level Programming Approach
– volume: 42
  start-page: 475
  issue: 4
  year: 2008
  ident: 10.1016/j.ejor.2020.09.015_bib0014
  article-title: "Global solution of bilevel programs with a nonconvex inner program
  publication-title: Journal of Global Optimization
  doi: 10.1007/s10898-007-9260-z
SSID ssj0001515
Score 2.4839473
Snippet •Deterministic bounding procedure (DBP) for a class of mixed-integer BL problems.•Convergent upper and lower bounds for the BL problem are computed.•New...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 52
SubjectTerms Bi-level optimization
Demand response
Dynamic tariffs
Electricity retail market
Global optimization
Mixed-integer linear programming model
Pricing problem
Title A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem
URI https://dx.doi.org/10.1016/j.ejor.2020.09.015
Volume 291
WOSCitedRecordID wos000608619800004&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: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-6860
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001515
  issn: 0377-2217
  databaseCode: AIEXJ
  dateStart: 19950105
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1ba9swFBZZO8b2sEu20e6GHvZmXBzZjuRHUzq2wsqgHeTNWBeXBNcuXhryq_obd-QjuUm7lW2wFxPsKHZ0PuscHen7DiEfE84icIs6jGWiYIJi4JVSJgu5FCZLEwiQK90Xm-AnJ2I2y76NRteeC7OqedOI9Tq7_K-mhnNgbEud_QtzDz8KJ-AzGB2OYHY4_pHh80C7LS69BnMgbeEk5JyDr9J2wcBvLXRqIC0MGxeOj4l8STkPa7ubKLiYr40Oe00J0wWu-sxvs_kusoUTnc8xOjGhIel82lrCE45M_SJ9PgT1eb3CK19h_l4Gx21_PW5v0rXN-Tl4yc4qHly5EgOHZVe3W7kLNrHL7kitxITaHVINErk4DxlDSueBwXFZcBZOBZYe8AM3wzpfWwjFYRhFcZ1Dx6oud1wFZi0WB2bRWl1YFvV6t8gtvSXBfWofyT4Rs-o-0UQ8ILuMpxk4gt38y9HsePD9Njzs163cX3A0LdxRePtOvw6FNsKbs-fkqZuX0Bzx9IKMTDMmjzwtYkye-fIf1HmDMXmyoWX5ksicbuGOetzRAXcUcEcBdxRxRzdxR9uKltTjjm7hjjrcvSLfPx2dHX4OXQGPUCVRtgyT0qiqTBk3iSyFFKlWJUTwwohsqlSUaugmHk-NTCqI2k0lJWcmSXikJxVPlY5fk52mbcweoQI8C3gnORVlnBgGEYaOdFWySaRTCKnjfTLxfVkop25vi6zUhd_GuChs_xe2_4soK6D_90kwtLlEbZd7v516ExUuOsWoswBE3dPuzT-2e0se37wy78jOsrsy78lDtVrOf3QfHPB-AgZFtp4
linkProvider Elsevier
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+deterministic+bounding+procedure+for+the+global+optimization+of+a+bi-level+mixed-integer+problem&rft.jtitle=European+journal+of+operational+research&rft.au=Soares%2C+In%C3%AAs&rft.au=Alves%2C+Maria+Jo%C3%A3o&rft.au=Henggeler+Antunes%2C+Carlos&rft.date=2021-05-16&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=291&rft.issue=1&rft.spage=52&rft.epage=66&rft_id=info:doi/10.1016%2Fj.ejor.2020.09.015&rft.externalDocID=S0377221720308018
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon