An Exact Solution Algorithm for Integer Bilevel Programming with Application in Energy Market Optimization

We develop an exact cutting plane solution algorithm for a special class of bilevel programming models utilized for optimal price-bidding of energy producers in day-ahead electricity markets. The proposed methodology utilizes a suitable reformulation in which a key prerequisite for global optimality...

Full description

Saved in:
Bibliographic Details
Published in:Journal of optimization theory and applications Vol. 197; no. 2; pp. 573 - 607
Main Authors: Kozanidis, George, Kostarelou, Eftychia
Format: Journal Article
Language:English
Published: New York Springer US 01.05.2023
Springer Nature B.V
Subjects:
ISSN:0022-3239, 1573-2878
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We develop an exact cutting plane solution algorithm for a special class of bilevel programming models utilized for optimal price-bidding of energy producers in day-ahead electricity markets. The proposed methodology utilizes a suitable reformulation in which a key prerequisite for global optimality, termed bilevel feasibility, is relaxed. Solving the problem to global optimality involves finding the price-offers of the strategic producer (upper-level decision variables) which maximize his self-profit upon clearing of the market and identification of the optimal energy quantity distribution (lower-level decision variables). To exclude from consideration the encountered bilevel infeasible solutions, the algorithm employs a special type of valid cuts drawn from the theory of integer parametric programming. The generation of these cuts involves finding the truly optimal lower-level solution using the strategic price-offers at the bilevel infeasible solution subject to exclusion and devising range intervals for these offers such that the optimality of this solution is retained when each of them lies in its corresponding interval. Each cut imposes a suitable part of this solution, under the condition that each price-offer belongs to its associated interval, which renders the bilevel infeasible solution invalid. We establish the theoretical framework for the development of the proposed algorithm, we illustrate its application on a small case study, and we present extensive computational results demonstrating its behavior and performance on random problem instances. These results indicate that the algorithm is capable of solving to global optimality considerably larger problems than those that a previous elementary version of the same algorithm could solve. This constitutes significant research contribution, considering the lack of generic optimization software for bilevel programming, as well as the fact that the applicability of specialized algorithms on problems of realistic size is rather limited.
AbstractList We develop an exact cutting plane solution algorithm for a special class of bilevel programming models utilized for optimal price-bidding of energy producers in day-ahead electricity markets. The proposed methodology utilizes a suitable reformulation in which a key prerequisite for global optimality, termed bilevel feasibility, is relaxed. Solving the problem to global optimality involves finding the price-offers of the strategic producer (upper-level decision variables) which maximize his self-profit upon clearing of the market and identification of the optimal energy quantity distribution (lower-level decision variables). To exclude from consideration the encountered bilevel infeasible solutions, the algorithm employs a special type of valid cuts drawn from the theory of integer parametric programming. The generation of these cuts involves finding the truly optimal lower-level solution using the strategic price-offers at the bilevel infeasible solution subject to exclusion and devising range intervals for these offers such that the optimality of this solution is retained when each of them lies in its corresponding interval. Each cut imposes a suitable part of this solution, under the condition that each price-offer belongs to its associated interval, which renders the bilevel infeasible solution invalid. We establish the theoretical framework for the development of the proposed algorithm, we illustrate its application on a small case study, and we present extensive computational results demonstrating its behavior and performance on random problem instances. These results indicate that the algorithm is capable of solving to global optimality considerably larger problems than those that a previous elementary version of the same algorithm could solve. This constitutes significant research contribution, considering the lack of generic optimization software for bilevel programming, as well as the fact that the applicability of specialized algorithms on problems of realistic size is rather limited.
Author Kostarelou, Eftychia
Kozanidis, George
Author_xml – sequence: 1
  givenname: George
  orcidid: 0000-0002-4325-2975
  surname: Kozanidis
  fullname: Kozanidis, George
  email: gkoz@mie.uth.gr
  organization: Department of Mechanical Engineering, University of Thessaly
– sequence: 2
  givenname: Eftychia
  surname: Kostarelou
  fullname: Kostarelou, Eftychia
  organization: Department of Mechanical Engineering, University of Thessaly
BookMark eNp9kE9LwzAYh4NMcJt-AU8Bz9X8adr0OMfUwWSCeg5pl9bMNqlpps5Pb2wFwcMOIYT8nt_78kzAyFijADjH6BIjlF51GGUsjRCh4eAkifgRGGOW0ojwlI_AGCFCIkpodgImXbdFCGU8jcdgOzNw8SkLDx9tvfPaGjirK-u0f2lgaR1cGq8q5eC1rtW7quGDs5WTTaNNBT9CCs7attaF7FEdyoxy1R7eS_eqPFy3Xjf6q_89BcelrDt19ntPwfPN4ml-F63Wt8v5bBUVNKE-wiopFeE4lrHMYsxLuokJ24S3jGPGeJGxguYcpShWZJNnMiEsK_M85yyTKWZ0Ci6G3tbZt53qvNjanTNhpAi1DCWIEhxSfEgVznadU6UotO_39E7qWmAkfsyKwawIZkVvVvCAkn9o63Qj3f4wRAeoC2ETjP5tdYD6BtcrjeM
CitedBy_id crossref_primary_10_1142_S0129156425402888
Cites_doi 10.1007/978-3-030-36979-8_2
10.1007/978-3-642-23193-3_2
10.1287/mnsc.23.5.453
10.1007/s10898-018-0679-1
10.1109/TPWRS.2012.2207921
10.1007/s10589-007-9066-4
10.1109/TPWRS.2012.2207920
10.1080/02331934.2013.801473
10.1023/A:1009677326718
10.1007/978-1-4613-1683-1
10.1287/opre.38.5.911
10.1016/j.compchemeng.2010.07.032
10.1007/s10898-009-9479-y
10.1109/TPWRS.2009.2030378
10.1109/TPWRS.2004.840378
10.1109/PTC.2017.7980796
10.1137/120864015
10.1109/TPWRS.2004.840397
10.1137/15M1051592
10.1080/01605682.2019.1590132
10.1007/b101970
10.1016/j.compchemeng.2014.06.004
10.1007/s10287-005-0025-1
10.1109/TPWRS.2007.907536
10.1016/j.ejor.2020.10.002
10.1287/opre.2017.1650
10.1007/BF00121269
10.1007/s11590-015-0872-9
10.1109/59.867153
10.1007/s10957-010-9668-3
10.1287/opre.2017.1589
10.1007/s11081-020-09521-y
10.1016/j.cor.2013.07.016
10.1007/978-0-387-88843-9_4
10.1007/978-1-4757-2836-1_4
ContentType Journal Article
Copyright The Author(s) 2023
The Author(s) 2023. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: The Author(s) 2023
– notice: The Author(s) 2023. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID C6C
AAYXX
CITATION
3V.
7SC
7TB
7WY
7WZ
7XB
87Z
88I
8AO
8FD
8FE
8FG
8FK
8FL
8G5
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FR3
FRNLG
F~G
GNUQQ
GUQSH
HCIFZ
JQ2
K60
K6~
K7-
KR7
L.-
L6V
L7M
L~C
L~D
M0C
M2O
M2P
M7S
MBDVC
P5Z
P62
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
DOI 10.1007/s10957-023-02166-8
DatabaseName Springer Nature OA Free Journals
CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
ProQuest ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Science 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 Materials Science & Engineering
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
Engineering Research Database
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
Civil Engineering Abstracts
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ABI/INFORM global
ProQuest 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
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
Engineering Research Database
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)
Mechanical & Transportation Engineering Abstracts
ProQuest Central (Alumni Edition)
ProQuest One Community College
Research Library (Alumni Edition)
ProQuest Pharma Collection
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Research Library
Advanced Technologies Database with Aerospace
ABI/INFORM Complete (Alumni Edition)
Civil Engineering Abstracts
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Science Journals
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)
CrossRef

Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
EISSN 1573-2878
EndPage 607
ExternalDocumentID 10_1007_s10957_023_02166_8
GrantInformation_xml – fundername: University of Thessaly Central Library
GroupedDBID -52
-5D
-5G
-BR
-EM
-Y2
-~C
-~X
.4S
.86
.DC
.VR
06D
0R~
0VY
199
1N0
1SB
2.D
203
28-
29L
2J2
2JN
2JY
2KG
2KM
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
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDPE
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
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
AYJHY
AZFZN
AZQEC
B-.
BA0
BAPOH
BBWZM
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
C6C
CAG
CCPQU
COF
CS3
CSCUP
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
GROUPED_ABI_INFORM_RESEARCH
GUQSH
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
H~9
I-F
I09
IHE
IJ-
IKXTQ
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
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P62
P9R
PF0
PKN
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
SCLPG
SDD
SDH
SDM
SHX
SISQX
SJYHP
SMT
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TEORI
TN5
TSG
TSK
TSV
TUC
TUS
TWZ
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
VH1
VOH
W23
W48
WH7
WK8
YLTOR
YQT
Z45
Z7R
Z7S
Z7U
Z7X
Z7Y
Z7Z
Z81
Z83
Z86
Z88
Z8M
Z8N
Z8R
Z8S
Z8T
Z8U
Z8W
Z92
ZCG
ZMTXR
ZWQNP
ZY4
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
ADXHL
AEZWR
AFDZB
AFFHD
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
AMVHM
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PQGLB
7SC
7TB
7XB
8FD
8FK
FR3
JQ2
KR7
L.-
L7M
L~C
L~D
MBDVC
PKEHL
PQEST
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c363t-1e6fe2814a4a9418f3d425d14aa44558c95c3b80704e2db9a6259fbbb859a7153
IEDL.DBID K7-
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000953804900002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0022-3239
IngestDate Wed Nov 05 00:46:10 EST 2025
Tue Nov 18 22:28:06 EST 2025
Sat Nov 29 06:02:32 EST 2025
Fri Feb 21 02:44:52 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Cutting planes
Integer parametric programming
90-08
Bilevel programming
Energy producers
Day-ahead electricity markets
Optimal bidding offers
90-10
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c363t-1e6fe2814a4a9418f3d425d14aa44558c95c3b80704e2db9a6259fbbb859a7153
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-4325-2975
OpenAccessLink https://link.springer.com/10.1007/s10957-023-02166-8
PQID 2815060321
PQPubID 48247
PageCount 35
ParticipantIDs proquest_journals_2815060321
crossref_citationtrail_10_1007_s10957_023_02166_8
crossref_primary_10_1007_s10957_023_02166_8
springer_journals_10_1007_s10957_023_02166_8
PublicationCentury 2000
PublicationDate 20230500
2023-05-00
20230501
PublicationDateYYYYMMDD 2023-05-01
PublicationDate_xml – month: 5
  year: 2023
  text: 20230500
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle Journal of optimization theory and applications
PublicationTitleAbbrev J Optim Theory Appl
PublicationYear 2023
Publisher Springer US
Springer Nature B.V
Publisher_xml – name: Springer US
– name: Springer Nature B.V
References Fischetti, Ljubić, Monaci, Sinnl (CR15) 2017; 65
Pereira, Granville, Fampa, Dix, Barroso (CR32) 2005; 20
Caramia, Mari (CR9) 2015; 9
Fampa, Barroso, Candal, Simonetti (CR13) 2008; 39
Xu, Wang (CR37) 2014; 41
Akbari-Dibavar, Mohammadi-Ivatloo, Zare, Nojavan, Zare (CR1) 2020
Bylling, Gabriel, Boomsma (CR7) 2020; 71
Gross, Finlay (CR17) 2000; 6
Gümüs, Floudas (CR18) 2005; 2
Kozanidis, Kostarelou, Andrianesis, Liberopoulos (CR23) 2013; 62
CR11
Köppe, Queyranne, Ryan (CR24) 2010; 146
Moore, Bard (CR31) 1990; 38
Ruiz, Conejo (CR33) 2009; 24
Lozano, Smith (CR29) 2017; 65
CR6
Wang, Xu (CR35) 2017; 27
CR5
Liu, Wang, Kong, Hu (CR27) 2021; 291
CR8
Geoffrion, Nauss (CR16) 1977; 23
Hobbs, Metzler, Pang (CR19) 2000; 15
Mitsos (CR30) 2010; 47
Andrianesis, Liberopoulos, Kozanidis, Papalexopoulos (CR3) 2013; 28
Wiesemann, Tsoukalas, Kleniati, Rustem (CR36) 2013; 23
Domínguez, Pistikopoulos (CR12) 2010; 34
Dempe (CR10) 2002
CR20
Kwon, Frances, Sorokin, Rebennack, Pardalos, Iliadis, Pereira (CR25) 2012
Kostarelou, Kozanidis (CR22) 2021; 22
Yue, Gao, Zeng, You (CR38) 2019; 73
Li, Shahidehpour (CR26) 2005; 20
Bakirtzis, Ziogos, Tellidou, Bakirtzis (CR4) 2007; 22
Schweppe, Caramanis, Tabors, Bohn (CR34) 1988
Kleniati, Adjiman (CR21) 2015; 72
Andrianesis, Liberopoulos, Kozanidis, Papalexopoulos (CR2) 2013; 28
Fernández-Blanco, Arroyo, Alguacil (CR14) 2017; 32
Loridan, Morgan (CR28) 1996; 8
AM Geoffrion (2166_CR16) 1977; 23
L Wang (2166_CR35) 2017; 27
RH Kwon (2166_CR25) 2012
2166_CR11
M Fampa (2166_CR13) 2008; 39
M Fischetti (2166_CR15) 2017; 65
G Gross (2166_CR17) 2000; 6
MV Pereira (2166_CR32) 2005; 20
S Dempe (2166_CR10) 2002
P Xu (2166_CR37) 2014; 41
G Kozanidis (2166_CR23) 2013; 62
JT Moore (2166_CR31) 1990; 38
P Andrianesis (2166_CR3) 2013; 28
R Fernández-Blanco (2166_CR14) 2017; 32
C Ruiz (2166_CR33) 2009; 24
D Yue (2166_CR38) 2019; 73
A Akbari-Dibavar (2166_CR1) 2020
HC Bylling (2166_CR7) 2020; 71
FC Schweppe (2166_CR34) 1988
AG Bakirtzis (2166_CR4) 2007; 22
T Li (2166_CR26) 2005; 20
M Caramia (2166_CR9) 2015; 9
L Lozano (2166_CR29) 2017; 65
2166_CR20
E Kostarelou (2166_CR22) 2021; 22
2166_CR5
ZH Gümüs (2166_CR18) 2005; 2
BF Hobbs (2166_CR19) 2000; 15
P Loridan (2166_CR28) 1996; 8
2166_CR6
W Wiesemann (2166_CR36) 2013; 23
P Andrianesis (2166_CR2) 2013; 28
A Mitsos (2166_CR30) 2010; 47
M Köppe (2166_CR24) 2010; 146
S Liu (2166_CR27) 2021; 291
P-M Kleniati (2166_CR21) 2015; 72
2166_CR8
LF Domínguez (2166_CR12) 2010; 34
References_xml – start-page: 19
  year: 2020
  end-page: 35
  ident: CR1
  article-title: Electricity market pricing: Uniform pricing vs pay-as-bid pricing
  publication-title: Electricity Markets
  doi: 10.1007/978-3-030-36979-8_2
– start-page: 41
  year: 2012
  end-page: 59
  ident: CR25
  article-title: Optimization-based bidding in day-ahead electricity auction markets: a review of models for power producers
  publication-title: Handbook of Networks in Power Systems I. Energy Systems
  doi: 10.1007/978-3-642-23193-3_2
– volume: 23
  start-page: 453
  year: 1977
  end-page: 466
  ident: CR16
  article-title: Parametric and postoptimality analysis in integer linear programming
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.23.5.453
– volume: 73
  start-page: 27
  year: 2019
  end-page: 57
  ident: CR38
  article-title: A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
  publication-title: J. Global Optim.
  doi: 10.1007/s10898-018-0679-1
– volume: 28
  start-page: 969
  year: 2013
  end-page: 977
  ident: CR3
  article-title: Recovery mechanisms in day-ahead electricity markets with non-convexities—Part II: implementation and numerical evaluation
  publication-title: IEEE Trans. Power Syst.
  doi: 10.1109/TPWRS.2012.2207921
– volume: 39
  start-page: 121
  year: 2008
  end-page: 142
  ident: CR13
  article-title: Bilevel optimization applied to strategic pricing in competitive electricity markets
  publication-title: Comput. Optim. Appl.
  doi: 10.1007/s10589-007-9066-4
– volume: 28
  start-page: 960
  year: 2013
  end-page: 968
  ident: CR2
  article-title: Recovery mechanisms in day-ahead electricity markets with non-convexities—Part I: design and evaluation methodology
  publication-title: IEEE Trans. Power Syst.
  doi: 10.1109/TPWRS.2012.2207920
– volume: 62
  start-page: 1045
  issue: 8
  year: 2013
  end-page: 1068
  ident: CR23
  article-title: Mixed integer parametric bilevel programming for optimal strategic bidding of energy producers in day-ahead electricity markets with indivisibilities
  publication-title: Optimization
  doi: 10.1080/02331934.2013.801473
– volume: 6
  start-page: 83
  year: 2000
  end-page: 98
  ident: CR17
  article-title: Generation supply bidding in perfectly competitive electricity markets
  publication-title: Comput. Math. Organ. Theory
  doi: 10.1023/A:1009677326718
– year: 1988
  ident: CR34
  publication-title: Spot Pricing of Electricity
  doi: 10.1007/978-1-4613-1683-1
– ident: CR6
– volume: 38
  start-page: 911
  year: 1990
  end-page: 921
  ident: CR31
  article-title: The mixed integer linear bilevel programming problem
  publication-title: Oper. Res.
  doi: 10.1287/opre.38.5.911
– volume: 34
  start-page: 2097
  year: 2010
  end-page: 2106
  ident: CR12
  article-title: Multiparametric programming based algorithms for pure integer and mixed-integer bilevel programming problems
  publication-title: Comput. Chem. Eng.
  doi: 10.1016/j.compchemeng.2010.07.032
– volume: 47
  start-page: 557
  year: 2010
  end-page: 582
  ident: CR30
  article-title: Global solution of nonlinear mixed-integer bilevel programs
  publication-title: J. Global Optim.
  doi: 10.1007/s10898-009-9479-y
– volume: 24
  start-page: 1855
  year: 2009
  end-page: 1866
  ident: CR33
  article-title: Pool strategy of a producer with endogenous formation of locational marginal prices
  publication-title: IEEE Trans. Power Syst.
  doi: 10.1109/TPWRS.2009.2030378
– ident: CR8
– volume: 20
  start-page: 437
  year: 2005
  end-page: 447
  ident: CR26
  article-title: Strategic bidding of transmission-constrained GENCOs with incomplete information
  publication-title: IEEE Trans. Power Syst.
  doi: 10.1109/TPWRS.2004.840378
– volume: 32
  start-page: 208
  issue: 1
  year: 2017
  end-page: 219
  ident: CR14
  article-title: On the solution of revenue-and network-constrained day-ahead market clearing under marginal pricing—Part I: an exact bilevel programming approach
  publication-title: IEEE Trans. Power Syst.
  doi: 10.1109/PTC.2017.7980796
– volume: 23
  start-page: 353
  year: 2013
  end-page: 380
  ident: CR36
  article-title: Pessimistic bilevel optimization
  publication-title: SIAM J. Optim.
  doi: 10.1137/120864015
– volume: 20
  start-page: 180
  year: 2005
  end-page: 188
  ident: CR32
  article-title: Strategic bidding under uncertainty: a binary expansion approach
  publication-title: IEEE Trans. Power Syst.
  doi: 10.1109/TPWRS.2004.840397
– volume: 27
  start-page: 1403
  year: 2017
  end-page: 1430
  ident: CR35
  article-title: The watermelon algorithm for the bilevel integer linear programming problem
  publication-title: SIAM J. Optim.
  doi: 10.1137/15M1051592
– volume: 71
  start-page: 846
  issue: 5
  year: 2020
  end-page: 865
  ident: CR7
  article-title: A parametric programming approach to bilevel optimisation with lower-level variables in the upper level
  publication-title: J. Oper. Res. Soc.
  doi: 10.1080/01605682.2019.1590132
– year: 2002
  ident: CR10
  publication-title: Foundations of Bilevel Programming
  doi: 10.1007/b101970
– volume: 72
  start-page: 373
  year: 2015
  end-page: 386
  ident: CR21
  article-title: A generalization of the branch-and-sandwich algorithm: From continuous to mixed-integer nonlinear bilevel problems
  publication-title: Comput. Chem. Eng.
  doi: 10.1016/j.compchemeng.2014.06.004
– volume: 2
  start-page: 181
  year: 2005
  end-page: 212
  ident: CR18
  article-title: Global optimization of mixed-integer bilevel programming problems
  publication-title: Comput. Manag. Sci.
  doi: 10.1007/s10287-005-0025-1
– volume: 22
  start-page: 1804
  year: 2007
  end-page: 1818
  ident: CR4
  article-title: Electricity producer offering strategies in day-ahead energy market with step-wise offers
  publication-title: IEEE Trans. Power Syst.
  doi: 10.1109/TPWRS.2007.907536
– volume: 291
  start-page: 661
  year: 2021
  end-page: 679
  ident: CR27
  article-title: An enhanced branch-and-bound algorithm for bilevel integer linear programming
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2020.10.002
– volume: 65
  start-page: 1615
  year: 2017
  end-page: 1637
  ident: CR15
  article-title: A new general-purpose algorithm for mixed-integer bilevel linear programs
  publication-title: Oper. Res.
  doi: 10.1287/opre.2017.1650
– ident: CR11
– volume: 8
  start-page: 263
  year: 1996
  end-page: 287
  ident: CR28
  article-title: Weak via strong Stackelberg problem: New results
  publication-title: J. Global Optim.
  doi: 10.1007/BF00121269
– volume: 9
  start-page: 1447
  year: 2015
  end-page: 1468
  ident: CR9
  article-title: Enhanced exact algorithms for discrete bilevel linear problems
  publication-title: Optim. Lett.
  doi: 10.1007/s11590-015-0872-9
– volume: 15
  start-page: 638
  year: 2000
  end-page: 645
  ident: CR19
  article-title: Strategic gaming analysis for electric power systems: an MPEC approach
  publication-title: IEEE Trans. Power Syst.
  doi: 10.1109/59.867153
– volume: 146
  start-page: 137
  year: 2010
  end-page: 150
  ident: CR24
  article-title: Parametric integer programming algorithm for bilevel mixed integer programs
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/s10957-010-9668-3
– ident: CR5
– volume: 65
  start-page: 768
  year: 2017
  end-page: 786
  ident: CR29
  article-title: A value-function-based exact approach for the bilevel mixed-integer programming problem
  publication-title: Oper. Res.
  doi: 10.1287/opre.2017.1589
– volume: 22
  start-page: 449
  issue: 1
  year: 2021
  end-page: 484
  ident: CR22
  article-title: Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities
  publication-title: Optim. Eng.
  doi: 10.1007/s11081-020-09521-y
– ident: CR20
– volume: 41
  start-page: 309
  year: 2014
  end-page: 318
  ident: CR37
  article-title: An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2013.07.016
– volume: 65
  start-page: 768
  year: 2017
  ident: 2166_CR29
  publication-title: Oper. Res.
  doi: 10.1287/opre.2017.1589
– volume: 27
  start-page: 1403
  year: 2017
  ident: 2166_CR35
  publication-title: SIAM J. Optim.
  doi: 10.1137/15M1051592
– volume: 23
  start-page: 353
  year: 2013
  ident: 2166_CR36
  publication-title: SIAM J. Optim.
  doi: 10.1137/120864015
– ident: 2166_CR11
  doi: 10.1007/978-0-387-88843-9_4
– volume: 20
  start-page: 437
  year: 2005
  ident: 2166_CR26
  publication-title: IEEE Trans. Power Syst.
  doi: 10.1109/TPWRS.2004.840378
– volume: 38
  start-page: 911
  year: 1990
  ident: 2166_CR31
  publication-title: Oper. Res.
  doi: 10.1287/opre.38.5.911
– volume: 20
  start-page: 180
  year: 2005
  ident: 2166_CR32
  publication-title: IEEE Trans. Power Syst.
  doi: 10.1109/TPWRS.2004.840397
– volume: 41
  start-page: 309
  year: 2014
  ident: 2166_CR37
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2013.07.016
– start-page: 19
  volume-title: Electricity Markets
  year: 2020
  ident: 2166_CR1
  doi: 10.1007/978-3-030-36979-8_2
– volume-title: Spot Pricing of Electricity
  year: 1988
  ident: 2166_CR34
  doi: 10.1007/978-1-4613-1683-1
– volume: 8
  start-page: 263
  year: 1996
  ident: 2166_CR28
  publication-title: J. Global Optim.
  doi: 10.1007/BF00121269
– volume: 39
  start-page: 121
  year: 2008
  ident: 2166_CR13
  publication-title: Comput. Optim. Appl.
  doi: 10.1007/s10589-007-9066-4
– volume: 9
  start-page: 1447
  year: 2015
  ident: 2166_CR9
  publication-title: Optim. Lett.
  doi: 10.1007/s11590-015-0872-9
– volume: 32
  start-page: 208
  issue: 1
  year: 2017
  ident: 2166_CR14
  publication-title: IEEE Trans. Power Syst.
  doi: 10.1109/PTC.2017.7980796
– volume: 28
  start-page: 960
  year: 2013
  ident: 2166_CR2
  publication-title: IEEE Trans. Power Syst.
  doi: 10.1109/TPWRS.2012.2207920
– volume: 15
  start-page: 638
  year: 2000
  ident: 2166_CR19
  publication-title: IEEE Trans. Power Syst.
  doi: 10.1109/59.867153
– volume: 73
  start-page: 27
  year: 2019
  ident: 2166_CR38
  publication-title: J. Global Optim.
  doi: 10.1007/s10898-018-0679-1
– volume: 23
  start-page: 453
  year: 1977
  ident: 2166_CR16
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.23.5.453
– volume: 24
  start-page: 1855
  year: 2009
  ident: 2166_CR33
  publication-title: IEEE Trans. Power Syst.
  doi: 10.1109/TPWRS.2009.2030378
– volume: 22
  start-page: 1804
  year: 2007
  ident: 2166_CR4
  publication-title: IEEE Trans. Power Syst.
  doi: 10.1109/TPWRS.2007.907536
– volume: 6
  start-page: 83
  year: 2000
  ident: 2166_CR17
  publication-title: Comput. Math. Organ. Theory
  doi: 10.1023/A:1009677326718
– volume-title: Foundations of Bilevel Programming
  year: 2002
  ident: 2166_CR10
  doi: 10.1007/b101970
– volume: 34
  start-page: 2097
  year: 2010
  ident: 2166_CR12
  publication-title: Comput. Chem. Eng.
  doi: 10.1016/j.compchemeng.2010.07.032
– ident: 2166_CR20
– volume: 28
  start-page: 969
  year: 2013
  ident: 2166_CR3
  publication-title: IEEE Trans. Power Syst.
  doi: 10.1109/TPWRS.2012.2207921
– volume: 62
  start-page: 1045
  issue: 8
  year: 2013
  ident: 2166_CR23
  publication-title: Optimization
  doi: 10.1080/02331934.2013.801473
– volume: 22
  start-page: 449
  issue: 1
  year: 2021
  ident: 2166_CR22
  publication-title: Optim. Eng.
  doi: 10.1007/s11081-020-09521-y
– volume: 71
  start-page: 846
  issue: 5
  year: 2020
  ident: 2166_CR7
  publication-title: J. Oper. Res. Soc.
  doi: 10.1080/01605682.2019.1590132
– ident: 2166_CR5
  doi: 10.1007/978-1-4757-2836-1_4
– ident: 2166_CR8
– start-page: 41
  volume-title: Handbook of Networks in Power Systems I. Energy Systems
  year: 2012
  ident: 2166_CR25
  doi: 10.1007/978-3-642-23193-3_2
– ident: 2166_CR6
– volume: 65
  start-page: 1615
  year: 2017
  ident: 2166_CR15
  publication-title: Oper. Res.
  doi: 10.1287/opre.2017.1650
– volume: 2
  start-page: 181
  year: 2005
  ident: 2166_CR18
  publication-title: Comput. Manag. Sci.
  doi: 10.1007/s10287-005-0025-1
– volume: 291
  start-page: 661
  year: 2021
  ident: 2166_CR27
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2020.10.002
– volume: 146
  start-page: 137
  year: 2010
  ident: 2166_CR24
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/s10957-010-9668-3
– volume: 72
  start-page: 373
  year: 2015
  ident: 2166_CR21
  publication-title: Comput. Chem. Eng.
  doi: 10.1016/j.compchemeng.2014.06.004
– volume: 47
  start-page: 557
  year: 2010
  ident: 2166_CR30
  publication-title: J. Global Optim.
  doi: 10.1007/s10898-009-9479-y
SSID ssj0009874
Score 2.362264
Snippet We develop an exact cutting plane solution algorithm for a special class of bilevel programming models utilized for optimal price-bidding of energy producers...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 573
SubjectTerms Algorithms
Applications of Mathematics
Calculus of Variations and Optimal Control; Optimization
Energy distribution
Engineering
Exact solutions
Hierarchies
Integers
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Programming
Theory of Computation
SummonAdditionalLinks – databaseName: SpringerLINK Contemporary 1997-Present
  dbid: RSV
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NT4MwFG90etCD38bpND140yZAC7RHNFs86Fz8WHYjLRSd2YcZuPjn-8pgTKMmeuDQUB7w-j7a1_d-Reg0il1LJYIRcI6aMBZTIjXoFWdOLKxEJTxPxuxe--027_VEpygKS8ts93JLMrfUC8VuwvUJ-Bi4bM8jfBmtgLvjRh3v7rsV1C4vsZcdQh0qilKZ72l8dkfVHPPLtmjubVqb__vOLbRRzC5xMBOHbbSkRztofQFzEFo3c6DWdBe9BCPcfJdRhsv4GA4GT-NJP3seYpjPYhMxhHfjC7AeUz3AnVk-1xBoYRPDxUG1A477QCyvJcQ3eTE1vgWDNCwqPffQY6v5cHlFiuMXSEQ9mhFbe4l2uM0kk4LZPKExKHgMbcmY6_JIuBFVHGwG006shDRLqUQpxV0hfbCk-6g2Go_0AcKxpRPtU1srLplvSQVSwDU3mW7KE65VR3Y5CmFUYJObIzIGYYWqbLgaAlfDnKshr6Oz-TOvM2SOX3s3ysENCy1NQ_g5g69IHbuOzsvBrG7_TO3wb92P0JqTy4PJk2ygWjZ508doNZpm_XRykkvvB1wR6OU
  priority: 102
  providerName: Springer Nature
Title An Exact Solution Algorithm for Integer Bilevel Programming with Application in Energy Market Optimization
URI https://link.springer.com/article/10.1007/s10957-023-02166-8
https://www.proquest.com/docview/2815060321
Volume 197
WOSCitedRecordID wos000953804900002&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: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1573-2878
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009874
  issn: 0022-3239
  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/eLvHCXMwpV3dT9wwDLf42MP2MMY2tBtwysPeIFqbpG3yNB3oENK4owLG2F6qpE03pruDcR3iz8fJpXSbNF72UEtRWyuVHTt17J8B3pVVEplaCYrO0VIhKk61xXUlBatUVJta-mTM86NsPJYXFyoPAbd5SKtsbaI31NVV6WLk75n0WHicxR-uf1LXNcqdroYWGsuwGjMWOz3_mNEOdFe2KMyMcsZVKJoJpXMqySh6LLziNKXyT8fU7Tb_OiD1fudg7X9n_AKehx0nGSxUZB2W7OwlPPsNhxBHowfw1vkr-DGYkeGdLhvSxszIYPINOTffpwT3uMRFEXGmZA8tyq2dkHyR4zVFXsTFdcmgOxUnl8jM1xeSkS-wJsdopKah-vM1fDoYnu0f0tCSgZY85Q2NbVpb_DChhVYiljWvcNFXONZCJIksVVJyI9GOCMsqo7T7vaqNMTJROkPrugErs6uZfQOkimxtMx5bI7XIIm1QM6SVLvvNpCqJehC38ijKgFfu2mZMig5p2cmwQBkWXoaF7MHOwzvXC7SOR5_eagVXhJU7Lzqp9WC3FX13-9_c3j7ObROeMq9tLldyC1aam192G56Ut83l_KYPy9nnL31Y3RuO85O-12Kko2jfUXbsae5odoo0T74iPTk9vwdtKfrX
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB4hQKIcWh5FbAvUBzhRq4ntJPahqrY8BGJ34UARt9ROHKDaXSgbaPun-hs79iYEKsGNA4ccrCQj2f5mbI9nvgFYz_IoMIUSFBdHS4XIOdUW9UoKlqugMIX0wZgnnaTXk6en6mgC_ta5MC6ssraJ3lDnl5nzkX9i0nPhcRZ-ufpJXdUod7tal9AYw-LA_vmFR7bR5_1tnN8NxnZ3jrf2aFVVgGY85iUNbVxYlCa00EqEsuA54jbHthYiimSmoowbiaogLMuN0u6EUBhjZKR0EroqEWjyp4RAdXChgsFWQ_Ira9ZnRjnjqkrSqVL1VJRQXCHxCeOYyocLYbO7_e9C1q9zu29e2gjNwetqR03aYxWYhwk7XIDZezyL2OrekdOOFuFHe0h2fuusJLVPkLT7Z9iT8nxAcA9PnJcUR4Z8RYt5a_vkaBzDNkBZxPmtSbu59ScXKMznT5KuTyAnh2iEB1V261v49ixdX4LJ4eXQLgPJA1vYhIfWSC2SQBtEvrTSRfeZWEVBC8J6_tOs4mN3ZUH6acMk7TCTImZSj5lUtmDz7p-rMRvJk1-v1EBJK8s0ShuUtOBjDbXm9ePS3j0t7QPM7B13O2lnv3fwHl4xj3QXF7oCk-X1jV2F6ey2vBhdr3mdIfD9uSH4D91qThc
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB4hiip6KNBSdVsePrQnapHYTmIfEFoeK9DCdg8t4hbsxGmpdhfKptD-NX4dY29CChLcOHDIwUoyUpxvZuzxzDcAn7I8CkyhBEXnaKkQOafaol5JwXIVFKaQPhnz6CDp9eTxsepPwXVdC-PSKmub6A11fpa5GPk6k54Lj7NwvajSIvo7nc3z39R1kHInrXU7jQlEuvbfFW7fxhv7O_ivPzPW2f22vUerDgM04zEvaWjjwqJkoYVWIpQFzxHDOY61EFEkMxVl3EhUC2FZbpR2u4XCGCMjpZPQdYxA8_8CvXDkdKyb0IbwV9YM0IxyxlVVsFOV7akooegt8QrjmMq7TrFZ6d47nPU-rzP3nGdrHl5XK23SnqjGAkzZ0Rt49R__Io4Ob0lrx2_hV3tEdv_qrCR1rJC0Bz_wS8qfQ4Jre-KipzhLZAst6aUdkP4kt22IsoiLZ5N2kw1ATlGYr6skh76wnHxF4zysql4X4fuTfPo7mB6djex7IHlgC5vw0BqpRRJogxohrXRZfyZWUdCCsMZCmlU87a5dyCBtGKYdflLET-rxk8oWrN2-cz5hKXn06aUaNGllscZpg5gWfKlh19x-WNqHx6WtwktEXnqw3-t-hFnmQe_SRZdgurz4Y5dhJrssT8cXK159CJw8NQJvALj8Vr0
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+Exact+Solution+Algorithm+for+Integer+Bilevel+Programming+with+Application+in+Energy+Market+Optimization&rft.jtitle=Journal+of+optimization+theory+and+applications&rft.au=Kozanidis%2C+George&rft.au=Kostarelou%2C+Eftychia&rft.date=2023-05-01&rft.pub=Springer+Nature+B.V&rft.issn=0022-3239&rft.eissn=1573-2878&rft.volume=197&rft.issue=2&rft.spage=573&rft.epage=607&rft_id=info:doi/10.1007%2Fs10957-023-02166-8&rft.externalDBID=HAS_PDF_LINK
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0022-3239&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0022-3239&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0022-3239&client=summon