Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON

In this paper, we present recent developments in the global optimization software BARON to address problems with integer variables. A primary development was the addition of mixed-integer linear programming relaxations to BARON's portfolio of linear and nonlinear programming relaxations, aiming...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Optimization methods & software Jg. 33; H. 3; S. 540 - 562
Hauptverfasser: Kılınç, Mustafa R., Sahinidis, Nikolaos V.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Abingdon Taylor & Francis Ltd 04.05.2018
Schlagworte:
ISSN:1055-6788, 1029-4937
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract In this paper, we present recent developments in the global optimization software BARON to address problems with integer variables. A primary development was the addition of mixed-integer linear programming relaxations to BARON's portfolio of linear and nonlinear programming relaxations, aiming to improve dual bounds and offer good starting points for primal heuristics. Since such relaxations necessitate the solution of NP-hard problems, their introduction to a branch-and-bound algorithm raises many practical issues regarding their effective implementation. In addition to describing BARON's dynamic strategy for deciding under what conditions to activate integer programming relaxations in the course of branch-and-bound, the paper also describes cutting plane and probing techniques that originate from the literature of integer linear programming and have been adapted in BARON to solve nonlinear problems. Finally, we describe BARON's primal heuristics for finding good solutions of mixed-integer nonlinear programmes. For all these techniques, we report extensive computational results on a public data set, aiming to analyse the impact of each technique in the solution process and identify techniques that expedite solution the most.
AbstractList In this paper, we present recent developments in the global optimization software BARON to address problems with integer variables. A primary development was the addition of mixed-integer linear programming relaxations to BARON's portfolio of linear and nonlinear programming relaxations, aiming to improve dual bounds and offer good starting points for primal heuristics. Since such relaxations necessitate the solution of NP-hard problems, their introduction to a branch-and-bound algorithm raises many practical issues regarding their effective implementation. In addition to describing BARON's dynamic strategy for deciding under what conditions to activate integer programming relaxations in the course of branch-and-bound, the paper also describes cutting plane and probing techniques that originate from the literature of integer linear programming and have been adapted in BARON to solve nonlinear problems. Finally, we describe BARON's primal heuristics for finding good solutions of mixed-integer nonlinear programmes. For all these techniques, we report extensive computational results on a public data set, aiming to analyse the impact of each technique in the solution process and identify techniques that expedite solution the most.
Author Sahinidis, Nikolaos V.
Kılınç, Mustafa R.
Author_xml – sequence: 1
  givenname: Mustafa R.
  surname: Kılınç
  fullname: Kılınç, Mustafa R.
  organization: Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, PA, USA
– sequence: 2
  givenname: Nikolaos V.
  orcidid: 0000-0003-2087-9131
  surname: Sahinidis
  fullname: Sahinidis, Nikolaos V.
  organization: Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, PA, USA
BookMark eNqFUDtPwzAYtFCRaAs_AckSc4ofsZOIqVTlISEqIZgtJ3ZaV05cHFe0_HqctiwsTHfD3X333QgMWtdqAK4xmmCUo1uMGONZnk8IwtkEUxYhPwNDjEiRpAXNBj1nLOlFF2DUdWuEUIpTPgR2vttYZ4Jpl9C0QS-9tCbsI4dhpeHSulJa6DbBNOZbBuNa6GrYmJ1WyUGvPYx1rGm19HDjXQxomj4t8tLqpoNfJqzg_fRt8XoJzmtpO311wjH4eJi_z56Sl8Xj82z6klQkxyGpcEFLpmpWlFRhVeCUaJrpginEVZ4zxjRWlNdKS85ojVNU01qyIuM807wq6BjcHHNjh8-t7oJYu61v40lBEKE0IzwnUXV3VFXedZ3XtahMOLwYvDRWYCT6ecXvvKKfV5zmjW72x73xppF-_4_vB6cdgLo
CitedBy_id crossref_primary_10_1088_1755_1315_322_1_012018
crossref_primary_10_1016_j_compchemeng_2020_106794
crossref_primary_10_1007_s11081_021_09707_y
crossref_primary_10_1016_j_compchemeng_2020_107126
crossref_primary_10_1007_s42405_023_00572_w
crossref_primary_10_1007_s11081_018_9411_8
crossref_primary_10_1007_s10589_024_00633_0
crossref_primary_10_1016_j_apenergy_2025_125413
crossref_primary_10_1016_j_ces_2021_117243
crossref_primary_10_1016_j_compchemeng_2025_109145
crossref_primary_10_1016_j_compchemeng_2019_02_013
crossref_primary_10_1016_j_ces_2020_116275
crossref_primary_10_3390_pr9071156
crossref_primary_10_3390_a12120252
crossref_primary_10_1002_aic_17740
crossref_primary_10_1002_aic_18832
crossref_primary_10_1016_j_eswa_2024_126167
crossref_primary_10_1016_j_compchemeng_2020_106845
crossref_primary_10_1016_j_compchemeng_2021_107634
crossref_primary_10_1002_aic_17340
crossref_primary_10_1007_s11081_020_09552_5
crossref_primary_10_1088_1755_1315_1196_1_012012
crossref_primary_10_1007_s11081_020_09505_y
crossref_primary_10_1016_j_applthermaleng_2020_116161
crossref_primary_10_1016_j_ifacol_2022_10_087
crossref_primary_10_1137_18M1197928
crossref_primary_10_1002_aic_17457
crossref_primary_10_1016_j_compchemeng_2020_106727
crossref_primary_10_1016_j_compchemeng_2022_107909
crossref_primary_10_1088_2058_9565_ad6735
crossref_primary_10_1287_opre_2022_2340
crossref_primary_10_1007_s11081_018_9412_7
crossref_primary_10_1109_TSG_2024_3424530
crossref_primary_10_1002_aic_17328
crossref_primary_10_1016_j_compchemeng_2022_108034
crossref_primary_10_1016_j_compchemeng_2019_106712
crossref_primary_10_1109_ACCESS_2022_3166153
crossref_primary_10_1007_s10107_021_01680_9
crossref_primary_10_1002_aic_16994
crossref_primary_10_3390_pr7120882
crossref_primary_10_1016_j_epsr_2022_108334
crossref_primary_10_1007_s10559_023_00544_8
crossref_primary_10_1016_j_jclepro_2021_127238
crossref_primary_10_1016_j_trb_2019_06_004
crossref_primary_10_1007_s10589_023_00485_0
crossref_primary_10_1016_j_ssci_2022_105894
crossref_primary_10_1016_j_trc_2021_103380
crossref_primary_10_1137_19M1271762
crossref_primary_10_1002_aic_17839
crossref_primary_10_1016_j_cej_2024_153664
crossref_primary_10_1007_s10589_024_00622_3
crossref_primary_10_1007_s10898_021_01027_w
crossref_primary_10_1016_j_compchemeng_2023_108227
crossref_primary_10_1080_13588265_2019_1701905
crossref_primary_10_1007_s11590_025_02208_2
crossref_primary_10_1002_bbb_2074
crossref_primary_10_1016_j_cor_2023_106335
crossref_primary_10_1007_s10107_024_02063_6
crossref_primary_10_3390_math11092033
crossref_primary_10_3390_w13091326
crossref_primary_10_1007_s10898_024_01412_1
crossref_primary_10_1007_s10107_021_01740_0
crossref_primary_10_1016_j_cej_2019_123412
crossref_primary_10_1016_j_energy_2024_133252
crossref_primary_10_1016_j_trb_2023_01_001
crossref_primary_10_1016_j_ejor_2024_07_033
crossref_primary_10_1016_j_dche_2023_100088
crossref_primary_10_1080_19401493_2022_2120631
crossref_primary_10_1016_j_compchemeng_2021_107550
crossref_primary_10_1016_j_jclepro_2024_142377
crossref_primary_10_1109_TAC_2021_3050440
crossref_primary_10_1016_j_compchemeng_2023_108520
crossref_primary_10_1016_j_compchemeng_2023_108369
crossref_primary_10_1016_j_jprocont_2019_12_011
crossref_primary_10_1016_j_compchemeng_2022_107859
crossref_primary_10_1287_ijoc_2020_1050
crossref_primary_10_1007_s11081_019_09438_1
crossref_primary_10_1007_s11081_020_09563_2
crossref_primary_10_1111_itor_13564
crossref_primary_10_1016_j_cherd_2021_09_005
crossref_primary_10_1109_JSYST_2023_3268604
crossref_primary_10_1016_j_ces_2020_116294
crossref_primary_10_1016_j_jclepro_2021_128780
crossref_primary_10_1007_s10957_024_02558_4
crossref_primary_10_1007_s11705_021_2071_9
crossref_primary_10_3390_pr7100753
crossref_primary_10_1016_j_ejor_2025_07_016
crossref_primary_10_1016_j_compchemeng_2024_108714
crossref_primary_10_1007_s12532_025_00288_w
crossref_primary_10_1287_ijoc_2023_0390
crossref_primary_10_1016_j_compchemeng_2019_106518
crossref_primary_10_1016_j_compchemeng_2021_107252
crossref_primary_10_1016_j_compchemeng_2020_107072
crossref_primary_10_1016_j_enconman_2022_115604
crossref_primary_10_1002_bbb_2411
crossref_primary_10_1016_j_energy_2022_126574
crossref_primary_10_1016_j_ces_2021_116766
crossref_primary_10_1016_j_memsci_2021_119514
Cites_doi 10.1007/s10107-008-0212-2
10.1007/BF01580665
10.1093/oso/9780195100563.001.0001
10.1016/S0098-1354(97)87599-0
10.1287/mnsc.32.10.1274
10.1007/s10107-003-0467-6
10.1007/BF00138689
10.1007/s10107-004-0518-7
10.1016/j.disopt.2006.10.004
10.1287/ijoc.15.1.114.15159
10.1080/10556788.2013.783032
10.1007/s10107-005-0581-8
10.1007/s12532-013-0060-9
10.1287/ijoc.10.4.427
10.1023/A:1008217604285
10.1007/s10589-010-9350-6
10.1007/s10898-011-9747-5
10.1007/s10898-014-0166-2
10.1007/978-1-4757-3532-1
10.1007/s10107-004-0559-y
10.1007/s101070100263
10.1007/s10107-003-0395-5
10.1016/j.sorms.2012.08.001
10.1021/ie3033763
10.1080/10556780902883184
10.1287/ijoc.6.4.445
10.1023/A:1008241411395
10.1007/s10898-014-0190-2
10.1016/0098-1354(94)00097-2
10.1016/j.orl.2004.04.002
10.1080/10556780902753221
10.1007/s10107-011-0496-5
10.1007/978-1-4614-1927-3
10.1007/s10898-012-9874-7
10.1017/S0962492913000032
10.1016/j.disopt.2010.09.005
10.1016/S0377-2217(99)00015-6
10.1007/s12532-014-0073-z
10.1007/978-3-662-03199-5
10.1287/opre.31.5.803
10.1007/BF00138693
10.1080/10556780903087124
ContentType Journal Article
Copyright 2017 Informa UK Limited, trading as Taylor & Francis Group
Copyright_xml – notice: 2017 Informa UK Limited, trading as Taylor & Francis Group
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1080/10556788.2017.1350178
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1029-4937
EndPage 562
ExternalDocumentID 10_1080_10556788_2017_1350178
GroupedDBID .4S
.7F
.DC
.QJ
0BK
0R~
123
29N
30N
4.4
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
AAYXX
ABCCY
ABDBF
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGEJ
ACGFS
ACIWK
ACTIO
ACUHS
ADCVX
ADGTB
ADXPE
AEISY
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AHDZW
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AMVHM
AQRUH
ARCSS
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CITATION
CS3
DGEBU
DKSSO
DU5
EAP
EBS
EDO
EMK
EPL
EST
ESX
E~A
E~B
F5P
GTTXZ
H13
HF~
HZ~
H~P
I-F
IPNFZ
J.P
KYCEM
M4Z
NA5
NY~
O9-
P2P
PQQKQ
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEJ
TFL
TFT
TFW
TTHFI
TUROJ
TUS
TWF
UT5
UU3
ZGOLN
~S~
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c281t-c193b5df59b3d1d9142e37e95d06d88555e1d36fdea653f140f3fa597667e6c93
ISICitedReferencesCount 119
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000429363700008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1055-6788
IngestDate Wed Aug 13 10:08:45 EDT 2025
Sat Nov 29 02:36:06 EST 2025
Tue Nov 18 21:25:36 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c281t-c193b5df59b3d1d9142e37e95d06d88555e1d36fdea653f140f3fa597667e6c93
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-2087-9131
PQID 2023372682
PQPubID 186278
PageCount 23
ParticipantIDs proquest_journals_2023372682
crossref_citationtrail_10_1080_10556788_2017_1350178
crossref_primary_10_1080_10556788_2017_1350178
PublicationCentury 2000
PublicationDate 2018-05-04
PublicationDateYYYYMMDD 2018-05-04
PublicationDate_xml – month: 05
  year: 2018
  text: 2018-05-04
  day: 04
PublicationDecade 2010
PublicationPlace Abingdon
PublicationPlace_xml – name: Abingdon
PublicationTitle Optimization methods & software
PublicationYear 2018
Publisher Taylor & Francis Ltd
Publisher_xml – name: Taylor & Francis Ltd
References CIT0050
CIT0052
CIT0051
CIT0010
CIT0054
CIT0031
CIT0053
CIT0012
CIT0034
CIT0056
CIT0011
CIT0033
CIT0055
Floudas C.A. (CIT0024) 1995
CIT0014
CIT0058
CIT0038
CIT0015
CIT0059
CIT0039
CIT0019
Floudas C.A. (CIT0025) 1999
CIT0061
CIT0041
CIT0063
CIT0062
CIT0021
CIT0043
CIT0020
Khajavirad A. (CIT0035)
CIT0042
CIT0001
CIT0023
CIT0003
CIT0047
CIT0002
CIT0005
CIT0049
CIT0004
CIT0048
CIT0007
CIT0029
CIT0006
Zhou K. (CIT0060)
CIT0008
References_xml – ident: CIT0012
  doi: 10.1007/s10107-008-0212-2
– ident: CIT0041
  doi: 10.1007/BF01580665
– volume-title: Nonlinear and Mixed-integer Optimization: Fundamentals and Applications
  year: 1995
  ident: CIT0024
  doi: 10.1093/oso/9780195100563.001.0001
– ident: CIT0053
  doi: 10.1016/S0098-1354(97)87599-0
– ident: CIT0003
  doi: 10.1287/mnsc.32.10.1274
– ident: CIT0055
  doi: 10.1007/s10107-003-0467-6
– ident: CIT0049
  doi: 10.1007/BF00138689
– ident: CIT0020
  doi: 10.1007/s10107-004-0518-7
– ident: CIT0001
  doi: 10.1016/j.disopt.2006.10.004
– ident: CIT0015
  doi: 10.1287/ijoc.15.1.114.15159
– ident: CIT0062
  doi: 10.1080/10556788.2013.783032
– ident: CIT0056
  doi: 10.1007/s10107-005-0581-8
– ident: CIT0010
  doi: 10.1007/s12532-013-0060-9
– ident: CIT0029
  doi: 10.1287/ijoc.10.4.427
– ident: CIT0047
  doi: 10.1023/A:1008217604285
– ident: CIT0011
  doi: 10.1007/s10589-010-9350-6
– ident: CIT0033
  doi: 10.1007/s10898-011-9747-5
– ident: CIT0043
  doi: 10.1007/s10898-014-0166-2
– ident: CIT0054
  doi: 10.1007/978-1-4757-3532-1
– ident: CIT0058
  doi: 10.1007/s10107-004-0559-y
– ident: CIT0021
  doi: 10.1007/s101070100263
– ident: CIT0023
  doi: 10.1007/s10107-003-0395-5
– ident: CIT0014
  doi: 10.1016/j.sorms.2012.08.001
– ident: CIT0061
  doi: 10.1021/ie3033763
– ident: CIT0005
  doi: 10.1080/10556780902883184
– ident: CIT0051
  doi: 10.1287/ijoc.6.4.445
– ident: CIT0052
  doi: 10.1023/A:1008241411395
– ident: CIT0063
  doi: 10.1007/s10898-014-0190-2
– volume-title: Deterministic Global Optimization, Vol. 37
  year: 1999
  ident: CIT0025
– ident: CIT0048
  doi: 10.1016/0098-1354(94)00097-2
– ident: CIT0002
  doi: 10.1016/j.orl.2004.04.002
– ident: CIT0039
  doi: 10.1080/10556780902753221
– ident: CIT0035
  publication-title: Math. Program. Comput
– ident: CIT0034
  doi: 10.1007/s10107-011-0496-5
– ident: CIT0038
  doi: 10.1007/978-1-4614-1927-3
– ident: CIT0042
  doi: 10.1007/s10898-012-9874-7
– ident: CIT0008
  doi: 10.1017/S0962492913000032
– ident: CIT0059
  doi: 10.1016/j.disopt.2010.09.005
– ident: CIT0004
  doi: 10.1016/S0377-2217(99)00015-6
– ident: CIT0006
  doi: 10.1007/s12532-014-0073-z
– ident: CIT0031
  doi: 10.1007/978-3-662-03199-5
– ident: CIT0019
  doi: 10.1287/opre.31.5.803
– ident: CIT0050
  doi: 10.1007/BF00138693
– ident: CIT0007
  doi: 10.1080/10556780903087124
– ident: CIT0060
  publication-title: J. Global Optim
SSID ssj0004146
Score 2.5008614
Snippet In this paper, we present recent developments in the global optimization software BARON to address problems with integer variables. A primary development was...
SourceID proquest
crossref
SourceType Aggregation Database
Enrichment Source
Index Database
StartPage 540
SubjectTerms Branch & bound algorithms
Global optimization
Impact analysis
Integer programming
Linear programming
Nonlinear programming
Title Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
URI https://www.proquest.com/docview/2023372682
Volume 33
WOSCitedRecordID wos000429363700008&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: PRVAWR
  databaseName: Taylor & Francis Online Journals
  customDbUrl:
  eissn: 1029-4937
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0004146
  issn: 1055-6788
  databaseCode: TFW
  dateStart: 19920101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3LbtNAFB2FwoIuEE-10KJZ0BVysT2e17LQRkhUKQJXZGfZnrGwSJ0Qh5L_4Ue583DsqIjHgo1jTexxMvf4zuvecxB6EWplWLREwCSjQaKkDARNWKA0kQnnPEq0smITfDIR06l8Pxr96HJhrme8acR6LRf_1dRQBsY2qbP_YO5NpVAA52B0OILZ4fhXhrdRdfXK5apYLgg70vbxjJ4AZA6e4sqnYNot9nqtVWCv18uXjePPMCzYLnzryuWsW-0Znw_3-uSDX9vyQ9uLYZVOmLq1wGrB03_P-yDbd7URiTcb9Nwux5oUrirvIxc_5p_rplaO_GBSf4HJ97z1wbh-fSISNhqwX59Mb0iFDOKVjMcNqcl-cNp-x9qXxUb6zrHBdG7a8WV4OJKBz6WO7-lGX-CCJ60AKFRvovi4UfmAD9F3ft2G_-QiG1-en2fp2TQ9IuPF18AIk5kN_CNy6kByC92OOZXGdabjT33yrU9h6_5HlyYmwle_fPb2AGi7_7eDmvQ-uudnI_jEoegBGunmIdodcFQ-QrMeT3iAJzjHgCfs8ISHeMLzCm_hCW_whAd4wh2esMETtnh6jC7HZ-mbt4GX6AjKWESroITxf0FVRWVBVKRklMSacC2pCpkSglKqI0VYpXTOKKlgNl-RKodJLGNcs1KSJ2gHfoPeQzgvcpi9s0JqWSRJrGRYEqJ0kcuqzEWi9lHStVtWev56I6MyyyJPc9s1d2aaO_PNvY-ON7ctHIHLn2446IyS-de6hQtiQnjMRPz0918_Q3f7l-AA7ayW3_QhulNer-p2-dwi5ydUWpqk
linkProvider Taylor & Francis
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=Exploiting+integrality+in+the+global+optimization+of+mixed-integer+nonlinear+programming+problems+with+BARON&rft.jtitle=Optimization+methods+%26+software&rft.au=Kilin%C3%A7%2C+Mustafa+R&rft.au=Sahinidis%2C+Nikolaos+V&rft.date=2018-05-04&rft.pub=Taylor+%26+Francis+Ltd&rft.issn=1055-6788&rft.eissn=1029-4937&rft.volume=33&rft.issue=3&rft.spage=540&rft_id=info:doi/10.1080%2F10556788.2017.1350178&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1055-6788&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1055-6788&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1055-6788&client=summon