Computing feasible points for binary MINLPs with MPECs

Nonconvex mixed-binary nonlinear optimization problems frequently appear in practice and are typically extremely hard to solve. In this paper we discuss a class of primal heuristics that are based on a reformulation of the problem as a mathematical program with equilibrium constraints. We then use d...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming computation Vol. 11; no. 1; pp. 95 - 118
Main Authors:	Schewe, Lars, Schmidt, Martin
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 14.03.2019 Springer Nature B.V
Subjects:	Feasibility studies Full Length Paper Iterative methods Iterative solution Mathematics Mathematics and Statistics Mathematics of Computing Nonlinear programming Operations Research/Decision Theory Optimization Production methods Regularization Solvers Theory of Computation Primal heuristic Complementarity constraints MPEC 90C11 90C33 90-08 MINLP 90C59 Mixed-integer nonlinear optimization
ISSN:	1867-2949, 1867-2957
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	Nonconvex mixed-binary nonlinear optimization problems frequently appear in practice and are typically extremely hard to solve. In this paper we discuss a class of primal heuristics that are based on a reformulation of the problem as a mathematical program with equilibrium constraints. We then use different regularization schemes for this class of problems and use an iterative solution procedure for solving series of regularized problems. In the case of success, these procedures result in a feasible solution of the original mixed-binary nonlinear problem. Since we rely on local nonlinear programming solvers the resulting method is fast and we further improve its reliability by additional algorithmic techniques. We show the strength of our method by an extensive computational study on 662 MINLPLib2instances, where our methods are able to produce feasible solutions for 60 % of all instances in at most 10 s .
AbstractList	Nonconvex mixed-binary nonlinear optimization problems frequently appear in practice and are typically extremely hard to solve. In this paper we discuss a class of primal heuristics that are based on a reformulation of the problem as a mathematical program with equilibrium constraints. We then use different regularization schemes for this class of problems and use an iterative solution procedure for solving series of regularized problems. In the case of success, these procedures result in a feasible solution of the original mixed-binary nonlinear problem. Since we rely on local nonlinear programming solvers the resulting method is fast and we further improve its reliability by additional algorithmic techniques. We show the strength of our method by an extensive computational study on 662 MINLPLib2instances, where our methods are able to produce feasible solutions for 60% of all instances in at most 10s. Nonconvex mixed-binary nonlinear optimization problems frequently appear in practice and are typically extremely hard to solve. In this paper we discuss a class of primal heuristics that are based on a reformulation of the problem as a mathematical program with equilibrium constraints. We then use different regularization schemes for this class of problems and use an iterative solution procedure for solving series of regularized problems. In the case of success, these procedures result in a feasible solution of the original mixed-binary nonlinear problem. Since we rely on local nonlinear programming solvers the resulting method is fast and we further improve its reliability by additional algorithmic techniques. We show the strength of our method by an extensive computational study on 662 MINLPLib2instances, where our methods are able to produce feasible solutions for 60 % of all instances in at most 10 s .
Author	Schmidt, Martin Schewe, Lars
Author_xml	– sequence: 1 givenname: Lars orcidid: 0000-0002-3778-262X surname: Schewe fullname: Schewe, Lars email: lars.schewe@fau.de organization: Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), Discrete Optimization, Energie Campus Nürnberg – sequence: 2 givenname: Martin orcidid: 0000-0001-6208-5677 surname: Schmidt fullname: Schmidt, Martin organization: Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), Discrete Optimization, Energie Campus Nürnberg
BookMark	eNp9kE9LAzEQxYNUsNZ-AG8Lnlcz2T9JjrJULbTag57DZjdbU9pkTVKs396UFQVBB4aZw_vNPN45GhlrFEKXgK8BY3rjgRQZSTGw2DmkhxM0BlbSlPCCjr73nJ-hqfcbHCsjlGV8jMrK7vp90GaddKr2Wm5V0lttgk866xKpTe0-kuX8cbHyybsOr8lyNav8BTrt6q1X0685QS93s-fqIV083c-r20XaZFCGlHEKDNNWtkqpDAjkUrUNACeSFgw3nHSslIS0DaeNzFvK86KjuCxa4KqWKpugq-Fu7-zbXvkgNnbvTHwpCHBgBcd5GVUwqBpnvXeqE73Tu2hcABbHhMSQkIgJiWNC4hAZ-otpdKiDtia4Wm__JclA-vjFrJX78fQ39AkDVnsV
CitedBy_id	crossref_primary_10_1007_s10898_024_01422_z crossref_primary_10_1016_j_compchemeng_2025_109006 crossref_primary_10_1016_j_compchemeng_2025_109039 crossref_primary_10_1007_s13675_019_00112_w crossref_primary_10_1080_23799927_2020_1861105 crossref_primary_10_1007_s10898_023_01345_1 crossref_primary_10_3390_en16165913 crossref_primary_10_1007_s13201_021_01480_8 crossref_primary_10_1016_j_compchemeng_2021_107440 crossref_primary_10_1007_s11081_018_9414_5 crossref_primary_10_1016_j_cor_2020_105208
Cites_doi	10.1007/s12532-011-0025-9 10.1007/s10107-003-0467-6 10.1137/S0036144504446096 10.1007/s12532-011-0032-x 10.1016/j.compchemeng.2004.03.011 10.1007/s00186-016-0533-5 10.1017/CBO9780511983658 10.1007/s10107-004-0559-y 10.1007/s101070100263 10.1007/978-3-642-38189-8_13 10.1287/ijoc.6.2.207 10.1007/s12532-008-0001-1 10.1007/978-1-4614-1927-3_15 10.1016/S1570-7946(07)80041-1 10.1137/S1052623403426556 10.1023/A:1008669226453 10.1007/s10107-005-0581-8 10.1007/s10107-008-0212-2 10.1007/s10288-011-0165-9 10.1137/S1052623499361233 10.1287/ijoc.1060.0175 10.1007/s12532-011-0031-y 10.1007/978-3-642-13193-6_30 10.1080/02331939208843795 10.1007/s10107-003-0395-5 10.1007/s10107-011-0488-5 10.1007/978-1-4757-3532-1 10.1016/j.compchemeng.2008.02.010 10.1080/02331939508844060 10.1007/s10107-013-0635-2 10.1007/s10589-010-9350-6 10.1007/s10957-004-5154-0 10.1007/s10107-012-0608-x 10.1137/1.9781611973693.ch9 10.1007/978-3-642-12598-0_8
ContentType	Journal Article
Copyright	Springer-Verlag GmbH Germany, part of Springer Nature and The Mathematical Programming Society 2018 Copyright Springer Nature B.V. 2019
Copyright_xml	– notice: Springer-Verlag GmbH Germany, part of Springer Nature and The Mathematical Programming Society 2018 – notice: Copyright Springer Nature B.V. 2019
DBID	AAYXX CITATION JQ2
DOI	10.1007/s12532-018-0141-x
DatabaseName	CrossRef ProQuest Computer Science Collection
DatabaseTitle	CrossRef ProQuest Computer Science Collection
DatabaseTitleList	ProQuest Computer Science Collection
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Mathematics
EISSN	1867-2957
EndPage	118
ExternalDocumentID	10_1007_s12532_018_0141_x
GroupedDBID	-5D -5G -BR -EM -~C 06D 0R~ 0VY 1N0 203 29M 2JY 2KG 2~H 30V 4.4 406 408 409 40D 40E 6NX 8UJ 96X AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH AAZMS ABAKF ABBXA ABDZT ABECU ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABMQK ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABWNU ABXPI ACAOD ACDTI ACGFS ACHSB ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEFQL AEGNC AEJHL AEJRE AEMSY AEOHA AEPYU AESKC AEVLU AEXYK AFBBN AFQWF AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGRTI AGWZB AGYKE AHAVH AHBYD AHKAY AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJRNO AJZVZ ALFXC ALMA_UNASSIGNED_HOLDINGS AMKLP AMXSW AMYLF AMYQR ANMIH AOCGG ASPBG AUKKA AVWKF AXYYD AYJHY AZFZN BA0 BAPOH BGNMA CSCUP DDRTE DNIVK DPUIP EBLON EBS EIOEI EJD ESBYG FERAY FFXSO FIGPU FNLPD FRRFC FYJPI GGCAI GGRSB GJIRD GQ6 GQ7 GQ8 GXS HG6 HLICF HMJXF HQYDN HRMNR I0C IJ- IKXTQ IWAJR IXC IXD IZIGR I~X J-C J0Z J9A JBSCW JCJTX JZLTJ KOV LLZTM M4Y NPVJJ NQJWS NU0 O93 O9J OAM OK1 P9R PT4 QOS R89 RLLFE ROL RSV S27 S3B SDH SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE T13 TSG U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W48 WK8 Z45 Z83 ZMTXR ~A9 2VQ AAAVM AAPKM AARHV AAYXX ABBRH ABDBE ABFSG ABRTQ ABULA ACSTC AEBTG AEKMD AEZWR AFDZB AFHIU AFLOW AFOHR AHPBZ AHSBF AHWEU AIXLP AJBLW ATHPR AYFIA CAG CITATION COF FINBP FSGXE H13 HF~ HZ~ O9- S1Z JQ2
ID	FETCH-LOGICAL-c316t-8971807dbdeee31214bedc1192b7580c92f86b22dc97cb4d7945f7065d19eabe3
IEDL.DBID	RSV
ISICitedReferencesCount	10
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000461392400003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1867-2949
IngestDate	Sun Nov 09 07:46:19 EST 2025 Sat Nov 29 06:19:08 EST 2025 Tue Nov 18 22:23:35 EST 2025 Fri Feb 21 02:33:18 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	Primal heuristic Complementarity constraints MPEC 90C11 90C33 90-08 MINLP 90C59 Mixed-integer nonlinear optimization
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c316t-8971807dbdeee31214bedc1192b7580c92f86b22dc97cb4d7945f7065d19eabe3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-3778-262X 0000-0001-6208-5677
PQID	2191859046
PQPubID	2044128
PageCount	24
ParticipantIDs	proquest_journals_2191859046 crossref_primary_10_1007_s12532_018_0141_x crossref_citationtrail_10_1007_s12532_018_0141_x springer_journals_10_1007_s12532_018_0141_x
PublicationCentury	2000
PublicationDate	20190314
PublicationDateYYYYMMDD	2019-03-14
PublicationDate_xml	– month: 3 year: 2019 text: 20190314 day: 14
PublicationDecade	2010
PublicationPlace	Berlin/Heidelberg
PublicationPlace_xml	– name: Berlin/Heidelberg – name: Heidelberg
PublicationSubtitle	A Publication of the Mathematical Optimization Society
PublicationTitle	Mathematical programming computation
PublicationTitleAbbrev	Math. Prog. Comp
PublicationYear	2019
Publisher	Springer Berlin Heidelberg Springer Nature B.V
Publisher_xml	– name: Springer Berlin Heidelberg – name: Springer Nature B.V
References	Luo, Pang, Ralph (CR27) 1996 Berthold, Heinz, Vigerske, Lee, Leyffer (CR7) 2012 Achterberg (CR1) 2009; 1 Tawarmalani, Sahinidis (CR38) 2002 Benoist, Estellon, Gardi, Megel, Nouioua (CR3) 2011; 9 Kraemer, Kossack, Marquardt (CR24) 2007; 24 Baumrucker, Renfro, Biegler (CR2) 2008; 32 Fischer (CR16) 1992; 24 CR18 Schmidt, Steinbach, Willert, Jünger, Reinelt (CR33) 2013 Rose, Schmidt, Steinbach, Willert (CR31) 2016; 83 CR15 CR14 CR34 Drud (CR13) 1994; 6 CR32 CR30 Koch, Achterberg, Andersen, Bastert, Berthold, Bixby, Danna, Gamrath, Gleixner, Heinz, Lodi, Mittelmann, Ralphs, Salvagnin, Steffy, Wolter (CR23) 2011; 3 Fischetti, Lodi (CR17) 2003; 98 D’Ambrosio, Frangioni, Liberti, Lodi (CR11) 2012; 136 Scholtes (CR35) 2001; 11 Stein, Oldenburg, Marquardt (CR36) 2004; 28 CR4 Sun, Qi (CR37) 1999; 13 Wächter, Biegler (CR42) 2006; 106 D’Ambrosio, Frangioni, Liberti, Lodi, Festa (CR10) 2010 Hu, Ralph (CR22) 2004; 123 Liberti, Mladenović, Nannicini (CR26) 2011; 3 Berthold, Gleixner (CR5) 2014; 144 CR6 CR28 Tawarmalani, Sahinidis (CR39) 2004; 99 Wächter, Biegler (CR43) 2005; 16 CR25 Gill, Murray, Saunders (CR19) 2005; 47 CR44 Tawarmalani, Sahinidis (CR40) 2005; 103 CR20 Dolan, Moré (CR12) 2002; 91 Nannicini, Belotti (CR29) 2012; 4 Bonami, Gonçalves (CR9) 2012; 51 Hoheisel, Kanzow, Schwartz (CR21) 2013; 137 Ugray, Lasdon, Plummer, Glover, Kelly, Martí (CR41) 2007; 19 Bonami, Cornuéjols, Lodi, Margot (CR8) 2009; 119 Ye, Zhu (CR45) 1995; 33 A Wächter (141_CR43) 2005; 16 K Kraemer (141_CR24) 2007; 24 Z Ugray (141_CR41) 2007; 19 JJ Ye (141_CR45) 1995; 33 M Tawarmalani (141_CR39) 2004; 99 O Stein (141_CR36) 2004; 28 141_CR20 M Tawarmalani (141_CR40) 2005; 103 M Fischetti (141_CR17) 2003; 98 AS Drud (141_CR13) 1994; 6 141_CR15 141_CR18 XM Hu (141_CR22) 2004; 123 141_CR34 T Hoheisel (141_CR21) 2013; 137 141_CR14 T Koch (141_CR23) 2011; 3 M Schmidt (141_CR33) 2013 C D’Ambrosio (141_CR11) 2012; 136 PE Gill (141_CR19) 2005; 47 P Bonami (141_CR8) 2009; 119 ZQ Luo (141_CR27) 1996 M Tawarmalani (141_CR38) 2002 A Wächter (141_CR42) 2006; 106 S Scholtes (141_CR35) 2001; 11 T Berthold (141_CR7) 2012 P Bonami (141_CR9) 2012; 51 141_CR30 141_CR32 T Benoist (141_CR3) 2011; 9 ED Dolan (141_CR12) 2002; 91 D Rose (141_CR31) 2016; 83 L Liberti (141_CR26) 2011; 3 D Sun (141_CR37) 1999; 13 C D’Ambrosio (141_CR10) 2010 T Berthold (141_CR5) 2014; 144 141_CR28 A Fischer (141_CR16) 1992; 24 141_CR44 141_CR25 141_CR4 141_CR6 G Nannicini (141_CR29) 2012; 4 BT Baumrucker (141_CR2) 2008; 32 T Achterberg (141_CR1) 2009; 1
References_xml	– volume: 3 start-page: 103 issue: 2 year: 2011 end-page: 163 ident: CR23 article-title: MIPLIB 2010 publication-title: Math. Program. Comput. doi: 10.1007/s12532-011-0025-9 – volume: 99 start-page: 563 issue: 3 year: 2004 end-page: 591 ident: CR39 article-title: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study publication-title: Math. Program. doi: 10.1007/s10107-003-0467-6 – volume: 47 start-page: 99 issue: 1 year: 2005 end-page: 131 ident: CR19 article-title: SNOPT: an SQP algorithm for large-scale constrained optimization publication-title: SIAM Rev. doi: 10.1137/S0036144504446096 – volume: 4 start-page: 1 issue: 1 year: 2012 end-page: 31 ident: CR29 article-title: Rounding-based heuristics for nonconvex MINLPs publication-title: Math. Program. Comput. doi: 10.1007/s12532-011-0032-x – volume: 28 start-page: 1951 issue: 10 year: 2004 end-page: 1966 ident: CR36 article-title: Continuous reformulations of discrete-continuous optimization problems publication-title: Comput. Chem. Eng. doi: 10.1016/j.compchemeng.2004.03.011 – ident: CR18 – volume: 83 start-page: 409 issue: 3 year: 2016 end-page: 444 ident: CR31 article-title: Computational optimization of gas compressor stations: MINLP models versus continuous reformulations publication-title: Math. Methods Oper. Res. doi: 10.1007/s00186-016-0533-5 – year: 1996 ident: CR27 publication-title: Mathematical Programs with Equilibrium Constraints doi: 10.1017/CBO9780511983658 – volume: 106 start-page: 25 issue: 1 year: 2006 end-page: 57 ident: CR42 article-title: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming publication-title: Math. Program. doi: 10.1007/s10107-004-0559-y – ident: CR4 – ident: CR14 – volume: 91 start-page: 201 year: 2002 end-page: 213 ident: CR12 article-title: Benchmarking optimization software with performance profiles publication-title: Math. Program. doi: 10.1007/s101070100263 – start-page: 295 year: 2013 end-page: 320 ident: CR33 article-title: A primal heuristic for nonsmooth mixed integer nonlinear optimization publication-title: Facets of Combinatorial Optimization doi: 10.1007/978-3-642-38189-8_13 – ident: CR30 – volume: 6 start-page: 207 issue: 2 year: 1994 end-page: 216 ident: CR13 article-title: CONOPT—a large-scale GRG code publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.6.2.207 – volume: 1 start-page: 1 issue: 1 year: 2009 end-page: 41 ident: CR1 article-title: SCIP: solving constraint integer programs publication-title: Math. Program. Comput. doi: 10.1007/s12532-008-0001-1 – start-page: 427 year: 2012 end-page: 444 ident: CR7 article-title: Extending a CIP framework to solve MIQCPs publication-title: Mixed Integer Nonlinear Programming doi: 10.1007/978-1-4614-1927-3_15 – ident: CR6 – volume: 24 start-page: 105 year: 2007 ident: CR24 article-title: An efficient solution method for the MINLP optimization of chemical processes publication-title: Comput. Aided Chem. Eng. doi: 10.1016/S1570-7946(07)80041-1 – volume: 16 start-page: 1 issue: 1 year: 2005 end-page: 31 ident: CR43 article-title: Line search filter methods for nonlinear programming: motivation and global convergence publication-title: SIAM J. Optim. doi: 10.1137/S1052623403426556 – ident: CR25 – volume: 13 start-page: 201 issue: 1 year: 1999 end-page: 220 ident: CR37 article-title: On NCP-functions publication-title: Comput. Optim. Appl. doi: 10.1023/A:1008669226453 – volume: 103 start-page: 225 issue: 2 year: 2005 end-page: 249 ident: CR40 article-title: A polyhedral branch-and-cut approach to global optimization publication-title: Math. Program. doi: 10.1007/s10107-005-0581-8 – volume: 119 start-page: 331 issue: 2 year: 2009 end-page: 352 ident: CR8 article-title: A feasibility pump for mixed integer nonlinear programs publication-title: Math. Program. doi: 10.1007/s10107-008-0212-2 – ident: CR44 – volume: 9 start-page: 299 issue: 3 year: 2011 ident: CR3 article-title: Localsolver 1.x: a black-box local-search solver for 0–1 programming publication-title: 4OR doi: 10.1007/s10288-011-0165-9 – volume: 11 start-page: 918 issue: 4 year: 2001 end-page: 936 ident: CR35 article-title: Convergence properties of a regularization scheme for mathematical programs with complementarity constraints publication-title: SIAM J. Optim. doi: 10.1137/S1052623499361233 – volume: 19 start-page: 328 issue: 3 year: 2007 end-page: 340 ident: CR41 article-title: Scatter search and local NLP solvers: a multistart framework for global optimization publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.1060.0175 – ident: CR15 – volume: 3 start-page: 349 issue: 4 year: 2011 end-page: 390 ident: CR26 article-title: A recipe for finding good solutions to MINLPs publication-title: Math. Program. Comput. doi: 10.1007/s12532-011-0031-y – start-page: 350 year: 2010 end-page: 360 ident: CR10 article-title: Experiments with a feasibility pump approach for nonconvex MINLPs publication-title: Experimental Algorithms doi: 10.1007/978-3-642-13193-6_30 – ident: CR32 – ident: CR34 – volume: 24 start-page: 269 issue: 3–4 year: 1992 end-page: 284 ident: CR16 article-title: A special Newton-type optimization method publication-title: Optimization doi: 10.1080/02331939208843795 – volume: 98 start-page: 23 issue: 1–3 year: 2003 end-page: 47 ident: CR17 article-title: Local branching publication-title: Math. Program. doi: 10.1007/s10107-003-0395-5 – volume: 137 start-page: 257 issue: 1 year: 2013 end-page: 288 ident: CR21 article-title: Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints publication-title: Math. Program. doi: 10.1007/s10107-011-0488-5 – year: 2002 ident: CR38 publication-title: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications doi: 10.1007/978-1-4757-3532-1 – volume: 32 start-page: 2903 issue: 12 year: 2008 end-page: 2913 ident: CR2 article-title: MPEC problem formulations and solution strategies with chemical engineering applications publication-title: Comput. Chem. Eng. doi: 10.1016/j.compchemeng.2008.02.010 – ident: CR28 – volume: 33 start-page: 9 issue: 1 year: 1995 end-page: 27 ident: CR45 article-title: Optimality conditions for bilevel programming problems publication-title: Optimization doi: 10.1080/02331939508844060 – volume: 144 start-page: 315 issue: 1 year: 2014 end-page: 346 ident: CR5 article-title: Undercover: a primal MINLP heuristic exploring a largest sub-MIP publication-title: Math. Program. doi: 10.1007/s10107-013-0635-2 – volume: 51 start-page: 729 issue: 2 year: 2012 end-page: 747 ident: CR9 article-title: Heuristics for convex mixed integer nonlinear programs publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-010-9350-6 – volume: 123 start-page: 365 issue: 2 year: 2004 end-page: 390 ident: CR22 article-title: Convergence of a penalty method for mathematical programming with complementarity constraints publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-004-5154-0 – ident: CR20 – volume: 136 start-page: 375 issue: 2 year: 2012 end-page: 402 ident: CR11 article-title: A storm of feasibility pumps for nonconvex MINLP publication-title: Math. Program. doi: 10.1007/s10107-012-0608-x – volume: 1 start-page: 1 issue: 1 year: 2009 ident: 141_CR1 publication-title: Math. Program. Comput. doi: 10.1007/s12532-008-0001-1 – ident: 141_CR44 – volume: 136 start-page: 375 issue: 2 year: 2012 ident: 141_CR11 publication-title: Math. Program. doi: 10.1007/s10107-012-0608-x – ident: 141_CR6 – volume: 24 start-page: 269 issue: 3–4 year: 1992 ident: 141_CR16 publication-title: Optimization doi: 10.1080/02331939208843795 – volume: 103 start-page: 225 issue: 2 year: 2005 ident: 141_CR40 publication-title: Math. Program. doi: 10.1007/s10107-005-0581-8 – volume: 24 start-page: 105 year: 2007 ident: 141_CR24 publication-title: Comput. Aided Chem. Eng. doi: 10.1016/S1570-7946(07)80041-1 – volume: 106 start-page: 25 issue: 1 year: 2006 ident: 141_CR42 publication-title: Math. Program. doi: 10.1007/s10107-004-0559-y – ident: 141_CR14 – volume: 13 start-page: 201 issue: 1 year: 1999 ident: 141_CR37 publication-title: Comput. Optim. Appl. doi: 10.1023/A:1008669226453 – volume: 3 start-page: 349 issue: 4 year: 2011 ident: 141_CR26 publication-title: Math. Program. Comput. doi: 10.1007/s12532-011-0031-y – start-page: 295 volume-title: Facets of Combinatorial Optimization year: 2013 ident: 141_CR33 doi: 10.1007/978-3-642-38189-8_13 – ident: 141_CR18 – volume: 47 start-page: 99 issue: 1 year: 2005 ident: 141_CR19 publication-title: SIAM Rev. doi: 10.1137/S0036144504446096 – volume: 137 start-page: 257 issue: 1 year: 2013 ident: 141_CR21 publication-title: Math. Program. doi: 10.1007/s10107-011-0488-5 – volume: 19 start-page: 328 issue: 3 year: 2007 ident: 141_CR41 publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.1060.0175 – volume: 123 start-page: 365 issue: 2 year: 2004 ident: 141_CR22 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-004-5154-0 – volume: 32 start-page: 2903 issue: 12 year: 2008 ident: 141_CR2 publication-title: Comput. Chem. Eng. doi: 10.1016/j.compchemeng.2008.02.010 – volume: 91 start-page: 201 year: 2002 ident: 141_CR12 publication-title: Math. Program. doi: 10.1007/s101070100263 – volume: 33 start-page: 9 issue: 1 year: 1995 ident: 141_CR45 publication-title: Optimization doi: 10.1080/02331939508844060 – ident: 141_CR20 – ident: 141_CR30 – volume: 28 start-page: 1951 issue: 10 year: 2004 ident: 141_CR36 publication-title: Comput. Chem. Eng. doi: 10.1016/j.compchemeng.2004.03.011 – ident: 141_CR28 – volume-title: Mathematical Programs with Equilibrium Constraints year: 1996 ident: 141_CR27 doi: 10.1017/CBO9780511983658 – ident: 141_CR34 doi: 10.1137/1.9781611973693.ch9 – volume: 6 start-page: 207 issue: 2 year: 1994 ident: 141_CR13 publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.6.2.207 – volume: 11 start-page: 918 issue: 4 year: 2001 ident: 141_CR35 publication-title: SIAM J. Optim. doi: 10.1137/S1052623499361233 – volume: 119 start-page: 331 issue: 2 year: 2009 ident: 141_CR8 publication-title: Math. Program. doi: 10.1007/s10107-008-0212-2 – ident: 141_CR4 – volume: 98 start-page: 23 issue: 1–3 year: 2003 ident: 141_CR17 publication-title: Math. Program. doi: 10.1007/s10107-003-0395-5 – volume: 51 start-page: 729 issue: 2 year: 2012 ident: 141_CR9 publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-010-9350-6 – start-page: 350 volume-title: Experimental Algorithms year: 2010 ident: 141_CR10 doi: 10.1007/978-3-642-13193-6_30 – ident: 141_CR15 – ident: 141_CR32 – volume: 99 start-page: 563 issue: 3 year: 2004 ident: 141_CR39 publication-title: Math. Program. doi: 10.1007/s10107-003-0467-6 – start-page: 427 volume-title: Mixed Integer Nonlinear Programming year: 2012 ident: 141_CR7 doi: 10.1007/978-1-4614-1927-3_15 – volume: 144 start-page: 315 issue: 1 year: 2014 ident: 141_CR5 publication-title: Math. Program. doi: 10.1007/s10107-013-0635-2 – volume: 3 start-page: 103 issue: 2 year: 2011 ident: 141_CR23 publication-title: Math. Program. Comput. doi: 10.1007/s12532-011-0025-9 – ident: 141_CR25 doi: 10.1007/978-3-642-12598-0_8 – volume: 9 start-page: 299 issue: 3 year: 2011 ident: 141_CR3 publication-title: 4OR doi: 10.1007/s10288-011-0165-9 – volume: 4 start-page: 1 issue: 1 year: 2012 ident: 141_CR29 publication-title: Math. Program. Comput. doi: 10.1007/s12532-011-0032-x – volume: 83 start-page: 409 issue: 3 year: 2016 ident: 141_CR31 publication-title: Math. Methods Oper. Res. doi: 10.1007/s00186-016-0533-5 – volume-title: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications year: 2002 ident: 141_CR38 doi: 10.1007/978-1-4757-3532-1 – volume: 16 start-page: 1 issue: 1 year: 2005 ident: 141_CR43 publication-title: SIAM J. Optim. doi: 10.1137/S1052623403426556
SSID	ssj0000327839
Score	2.1799724
Snippet	Nonconvex mixed-binary nonlinear optimization problems frequently appear in practice and are typically extremely hard to solve. In this paper we discuss a...
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	95
SubjectTerms	Feasibility studies Full Length Paper Iterative methods Iterative solution Mathematics Mathematics and Statistics Mathematics of Computing Nonlinear programming Operations Research/Decision Theory Optimization Production methods Regularization Solvers Theory of Computation
Title	Computing feasible points for binary MINLPs with MPECs
URI	https://link.springer.com/article/10.1007/s12532-018-0141-x https://www.proquest.com/docview/2191859046
Volume	11
WOSCitedRecordID	wos000461392400003&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 customDbUrl: eissn: 1867-2957 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000327839 issn: 1867-2949 databaseCode: RSV dateStart: 20090701 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/eLvHCXMwnV1JSwMxFA5SPejBXaxWycGTEkgya45SWhRsKW70NmQbKJRp6Yziz_dlOtNRUUEvA0MWwkte3vfyNoQulPSk9ZQgUkUUFBQRECUDSyKWRhxWriRPy2IT0XAYj8diVMVx57W3e22SLG_qJtiNB55zI3DOVz4jABzXQdrFrl7D_cPz6mGFeq54hIO9Llcb4cIXtTXzu1k-y6MGZH6xi5bipr_zr4Xuou0KXeLr5XHYQ2s220dbH3IOwt9glag1P0DhsqoDtODUSmCPqcXz2SQrcgxoFqsyWhcPbod3oxy7N1s8GPW6-SF66vceuzekKqVAtMfCgsQCZBCNjDLWWo9x5itrNAN4p0BhoFrwNA4V50aLSCvfAJcGqbOAGiasVNY7Qq1sltljhFMRiwDALqUp82UQS6P9mIYGkB58I9tGtCZooqs8467cxTRpMiQ7AiVAoMQRKHlro8vVkPkyycZvnTv1LiUVv-UJ3LsAPAQo-210Ve9K0_zjZCd_6n2KNgEvCeeCxvwOahWLF3uGNvRrMckX5-UxfAewA9XX
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwEA-igvrgtzidmgeflEKTph95lLGx4TqGTtlbSNoUBqMbaxX_fC9du6qooC-Fkg_CJZf7JXf5HULXSjpSO4pbUvk2HFC4aynpassniU9h5ErSpEg24Q8GwXjMh-U77qyKdq9cksVOXT92o65jwghM8BUjFgDHDQYGyxDmPzw-ry5WbMckjzCw13C1WZQzXnkzv-vlsz2qQeYXv2hhbjp7_xroPtot0SW-Wy6HA7Sm00O084FzEP7CFVFrdoS8ZVYHKMGJlqAeU43ns0maZxjQLFbFa10c9gb9YYbNnS0Oh-1WdoyeOu1Rq2uVqRSsyCFebgUcbJDtxyrWWjuEEqZ0HBGAdwoODHbEaRJ4itI44n6kWAxa6ibGAxoTrqXSzglaT2epPkU44QF3AezadkKYdAMZRyywvRiQHnx93UB2JVARlTzjJt3FVNQMyUZAAgQkjIDEWwPdrJrMlyQbv1VuVrMkSn3LBOy7ADw4HPYb6Laalbr4x87O_lT7Cm11R2Ff9HuD-3O0DdiJm3A0wppoPV-86Au0Gb3mk2xxWSzJd78I2Ls
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwEA-iIvrgtzidmgeflLKkTT_yKHPD4TYKfrC3kjQpDEY31ir--V66dlVRQXwplKQhXHK9X3J3v0PoUgpHaEdyS0ifwAGFu5YUrrZ8mvg2zFwKOymKTfjDYTAa8bCsc5pV0e6VS3KR02BYmtK8NVNJq058s13HhBSYQCxGLQCRa8zE0Zvj-sPz8pKFOKaQhIHAhrfNsjnjlWfzu1E-26YacH7xkRamp7vz70nvou0SdeKbxTbZQys63UdbH7gI4W2wJHDNDpC3qPYALTjRAtRmovFsOk7zDAPKxbLI4sWD3rAfZtjc5eJB2Glnh-ip23ls31lliQUrdqiXWwEH20R8JZXW2qE2ZVKrmALsk3CQIDG3k8CTtq1i7seSKdBeNzGeUUW5FlI7R2g1nab6GOGEB9wFEExIQplwA6FiFhBPAQKEp68biFTCjeKSf9yUwZhENXOyEVAEAoqMgKK3BrpafjJbkG_81rlZrVhU6mEWwf8YAAknzGug62qF6uYfBzv5U-8LtBHedqN-b3h_ijYBUnETpUZZE63m8xd9htbj13yczc-L3fkOhyvhnw
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=Computing+feasible+points+for+binary+MINLPs+with+MPECs&rft.jtitle=Mathematical+programming+computation&rft.au=Schewe%2C+Lars&rft.au=Schmidt%2C+Martin&rft.date=2019-03-14&rft.issn=1867-2949&rft.eissn=1867-2957&rft.volume=11&rft.issue=1&rft.spage=95&rft.epage=118&rft_id=info:doi/10.1007%2Fs12532-018-0141-x&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s12532_018_0141_x
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1867-2949&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1867-2949&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1867-2949&client=summon