An algorithm for two-stage stochastic mixed-integer nonlinear convex problems
We present an algorithm to solve two-stage stochastic convex problems, whose objective function and constraints are nonlinear. It is based on the twin-node-family concept involved in the Branch-and-Fix Coordination method. These problems have 0–1 mixed-integer recourse variables in the first stage a...
Uloženo v:
| Vydáno v: | Annals of operations research Ročník 235; číslo 1; s. 581 - 598 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York
Springer US
01.12.2015
Springer Springer Nature B.V |
| Témata: | |
| ISSN: | 0254-5330, 1572-9338 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We present an algorithm to solve two-stage stochastic convex problems, whose objective function and constraints are nonlinear. It is based on the twin-node-family concept involved in the Branch-and-Fix Coordination method. These problems have 0–1 mixed-integer recourse variables in the first stage and only continuous variables in the second stage. The non-anticipativity constraints are satisfied by means of the twin-node-family strategy. In this work to solve each nonlinear convex subproblem at each node we propose the solution of sequences of quadratic subproblems. Since the convexity of the constraints we can approximate them by means of outer approximations. These methods have been implemented in C
+
+
with the help of Cplex 12.1, which only solves the quadratic approximations. The test problems have been randomly generated by using a C
+
+
code developed by this author. Numerical experiments have been performed and its efficiency has been compared with that of well-known codes. |
|---|---|
| AbstractList | (ProQuest: ... denotes formulae and/or non-USASCII text omitted; see image).We present an algorithm to solve two-stage stochastic convex problems, whose objective function and constraints are nonlinear. It is based on the twin-node-family concept involved in the Branch-and-Fix Coordination method. These problems have 0-1 mixed-integer recourse variables in the first stage and only continuous variables in the second stage. The non-anticipativity constraints are satisfied by means of the twin-node-family strategy. In this work to solve each nonlinear convex subproblem at each node we propose the solution of sequences of quadratic subproblems. Since the convexity of the constraints we can approximate them by means of outer approximations. These methods have been implemented in C... with the help of Cplex 12.1, which only solves the quadratic approximations. The test problems have been randomly generated by using a C... code developed by this author. Numerical experiments have been performed and its efficiency has been compared with that of well-known codes. We present an algorithm to solve two-stage stochastic convex problems, whose objective function and constraints are nonlinear. It is based on the twin-node-family concept involved in the Branch-and-Fix Coordination method. These problems have 0-1 mixed-integer recourse variables in the first stage and only continuous variables in the second stage. The non-anticipativity constraints are satisfied by means of the twin-node-family strategy. In this work to solve each nonlinear convex subproblem at each node we propose the solution of sequences of quadratic subproblems. Since the convexity of the constraints we can approximate them by means of outer approximations. These methods have been implemented in C with the help of Cplex 12.1, which only solves the quadratic approximations. The test problems have been randomly generated by using a C code developed by this author. Numerical experiments have been performed and its efficiency has been compared with that of well-known codes. We present an algorithm to solve two-stage stochastic convex problems, whose objective function and constraints are nonlinear. It is based on the twin-node-family concept involved in the Branch-and-Fix Coordination method. These problems have 0–1 mixed-integer recourse variables in the first stage and only continuous variables in the second stage. The non-anticipativity constraints are satisfied by means of the twin-node-family strategy. In this work to solve each nonlinear convex subproblem at each node we propose the solution of sequences of quadratic subproblems. Since the convexity of the constraints we can approximate them by means of outer approximations. These methods have been implemented in C + + with the help of Cplex 12.1, which only solves the quadratic approximations. The test problems have been randomly generated by using a C + + code developed by this author. Numerical experiments have been performed and its efficiency has been compared with that of well-known codes. |
| Audience | Academic |
| Author | Mijangos, E. |
| Author_xml | – sequence: 1 givenname: E. surname: Mijangos fullname: Mijangos, E. email: eugenio.mijangos@ehu.es organization: Department of Applied Mathematics and Statistics and Operations Research, University of the Basque Country UPV/EHU |
| BookMark | eNp9kU1v1DAQhi1UJLYLP4BbJC4cSBnbie0cVxVfUhEXOFtOdpJ1ldjF40D593i1HLYVIEu2ZT2PZzTvJbsIMSBjLzlccQD9ljg0uquBtzU3Xbk8YRvealF3UpoLtgHRNnUrJTxjl0S3AMC5aTfs8y5Ubp5i8vmwVGNMVf4Za8puwopyHA6Osh-qxd_jvvYh44SpKrVnH9ClaojhB95Xdyn2My70nD0d3Uz44s-5Zd_ev_t6_bG--fLh0_Xuph4ao3LdCWeaDrUaR9QgdK-gb9p2HEBD3-umk3uNojU9xxGE0cI1Ao3QSu-VQePklr0-_VsKf1-Rsl08DTjPLmBcyXKtDSjolCzoq0fobVxTKN0VSirJBZxTk5vR-jDGnNxw_NTuGtkq1YjS1ZZd_YUqa4-LL6PA0Zf3B8KbM6FfqUyNykZ-OmSa3Er0EOcnfEiRKOFo75JfXPplOdhjzPYUsy0x22PMFoqjHzmDzy77GEpvfv6vKU4mlSqh5Ho2mX9KvwGTELti |
| CitedBy_id | crossref_primary_10_1016_j_compchemeng_2018_01_017 crossref_primary_10_1007_s10479_018_3032_7 crossref_primary_10_1007_s11081_020_09563_2 crossref_primary_10_1007_s10898_019_00820_y crossref_primary_10_1007_s10898_020_00986_w crossref_primary_10_1007_s10898_019_00816_8 crossref_primary_10_1007_s10898_024_01433_w |
| Cites_doi | 10.1016/S0377-2217(02)00628-8 10.1023/A:1011241421041 10.1016/j.omega.2004.05.001 10.1515/9781400873173 10.1023/A:1013827731218 10.1016/j.cor.2011.06.021 10.1007/978-3-642-46216-0 10.1137/0114008 10.1016/j.cor.2008.11.011 10.1287/opre.50.3.415.7751 10.1016/0305-0548(94)90024-8 10.1016/j.compchemeng.2003.11.003 10.1016/j.disopt.2006.10.011 10.1016/j.ejor.2009.09.027 10.1007/s10107-006-0724-6 10.1007/s10107-005-0592-5 10.1093/oso/9780195100563.001.0001 10.1137/1.9780898718799 10.1007/978-3-642-36062-6_18 10.1007/978-3-642-36062-6_51 |
| ContentType | Journal Article |
| Copyright | Springer Science+Business Media New York 2015 COPYRIGHT 2015 Springer |
| Copyright_xml | – notice: Springer Science+Business Media New York 2015 – notice: COPYRIGHT 2015 Springer |
| DBID | AAYXX CITATION N95 3V. 7TA 7TB 7WY 7WZ 7XB 87Z 88I 8AL 8AO 8FD 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FR3 FRNLG F~G GNUQQ HCIFZ JG9 JQ2 K60 K6~ K7- KR7 L.- L6V M0C M0N M2P M7S P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U |
| DOI | 10.1007/s10479-015-1899-0 |
| DatabaseName | CrossRef Gale_Business Insights: Global ProQuest Central (Corporate) Materials Business File Mechanical & Transportation Engineering Abstracts ProQuest_ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Global (Alumni Edition) Science Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) ProQuest SciTech Premium Collection Technology Collection Materials Science & Engineering Database ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest SciTech Premium Collection Technology Collection Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Central Business Premium Collection ProQuest Technology Collection ProQuest One ProQuest Central Korea Engineering Research Database Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Collection (ProQuest) Materials Research Database 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 ABI/INFORM Global Computing Database Science Database (ProQuest) Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ProQuest Central Basic |
| DatabaseTitle | CrossRef Materials Research Database ProQuest Business Collection (Alumni Edition) Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ProQuest Central China ABI/INFORM Complete Materials Business File 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 ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Central Korea ABI/INFORM Complete (Alumni Edition) Civil Engineering Abstracts ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | Materials Research Database Materials Research Database |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1572-9338 |
| EndPage | 598 |
| ExternalDocumentID | 3876956001 A435664249 10_1007_s10479_015_1899_0 |
| GroupedDBID | -4X -57 -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 2.D 203 23M 28- 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 7WY 88I 8AO 8FE 8FG 8FL 8TC 8VB 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 ABDZT ABECU ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP 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 ADIMF 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 AHQJS AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ AKVCP ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYQZM AZFZN AZQEC B-. BA0 BAPOH BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DWQXO EBLON EBO EBS EBU 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 GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I-F I09 IAO IEA IHE IJ- IKXTQ ITC ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K1G K60 K6V K6~ K7- KDC KOV KOW L6V LAK LLZTM M0C M0N M2P M4Y M7S MA- N2Q N95 N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P62 P9M PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS QWB R4E R89 R9I RHV RNI RNS ROL RPX RSV RZC RZD RZK S16 S1Z S26 S27 S28 S3B SAP SBE SCF SCLPG SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TH9 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z5O Z7R Z7S Z7U Z7V Z7W Z7X Z7Y Z7Z Z81 Z83 Z88 Z8N Z8U Z92 ZL0 ZMTXR ZYFGU ~8M ~A9 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG ADKFA AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP AMVHM ATHPR AYFIA CITATION ICD PHGZM PHGZT PQGLB 7TA 7TB 7XB 8AL 8FD 8FK FR3 JG9 JQ2 KR7 L.- PKEHL PQEST PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c486t-92a849e76ffe7027b60b455fc070bb7493d7e258b1ef02872a42e82767d68e8a3 |
| IEDL.DBID | M2P |
| ISICitedReferencesCount | 7 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000365867100026&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0254-5330 |
| IngestDate | Sun Nov 09 10:08:05 EST 2025 Wed Nov 05 14:51:23 EST 2025 Sat Nov 29 13:24:35 EST 2025 Sun Nov 23 09:01:35 EST 2025 Sat Nov 29 08:39:31 EST 2025 Sat Nov 29 02:36:31 EST 2025 Tue Nov 18 21:56:37 EST 2025 Fri Feb 21 02:36:58 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Outer approximation Mixed-integer nonlinear programming Quadratic programming Convex programming Branch-and-fix coordination method Stochastic programming |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c486t-92a849e76ffe7027b60b455fc070bb7493d7e258b1ef02872a42e82767d68e8a3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| PQID | 1736312063 |
| PQPubID | 25585 |
| PageCount | 18 |
| ParticipantIDs | proquest_miscellaneous_1778060963 proquest_journals_1736312063 gale_infotracmisc_A435664249 gale_infotracacademiconefile_A435664249 gale_businessinsightsgauss_A435664249 crossref_primary_10_1007_s10479_015_1899_0 crossref_citationtrail_10_1007_s10479_015_1899_0 springer_journals_10_1007_s10479_015_1899_0 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-12-01 |
| PublicationDateYYYYMMDD | 2015-12-01 |
| PublicationDate_xml | – month: 12 year: 2015 text: 2015-12-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Annals of operations research |
| PublicationTitleAbbrev | Ann Oper Res |
| PublicationYear | 2015 |
| Publisher | Springer US Springer Springer Nature B.V |
| Publisher_xml | – name: Springer US – name: Springer – name: Springer Nature B.V |
| References | Wets (CR21) 1966; 14 Sherali, Zhu (CR17) 2006; 108 Sherali, Fraticelli (CR18) 2002; 22 Floudas (CR9) 1995 Escudero, Garín, Merino, Pérez (CR7) 2010; 204 Laporte, Louveaux (CR12) 2002; 50 Alonso-Ayuso, Escudero, Ortuño (CR1) 2003; 151 Stoer, Witzgall (CR19) 1970 Bonami, Biegler, Conn, Cornuéjols, Grossmann, Laird, Lee, Lodi, Margot, Sawaya, Wätcher (CR4) 2008; 5 Alonso-Ayuso, Escudero, Garín, Ortuño, Pérez (CR2) 2005; 33 CR14 Borchers, Mitchell (CR5) 1994; 21 CR11 CR20 Escudero, Garín, Merino, Pérez (CR8) 2012; 39 Sen, Sherali (CR16) 2006; 105 Leyffer (CR13) 2001; 18 Biegler, Grossmann (CR3) 2004; 28 Grossmann (CR10) 2002; 28 Rockafellar (CR15) 1970 Escudero, Garín, Merino, Pérez (CR6) 2009; 36 LF Escudero (1899_CR8) 2012; 39 CA Floudas (1899_CR9) 1995 G Laporte (1899_CR12) 2002; 50 H Sherali (1899_CR17) 2006; 108 RJB Wets (1899_CR21) 1966; 14 P Bonami (1899_CR4) 2008; 5 B Borchers (1899_CR5) 1994; 21 IE Grossmann (1899_CR10) 2002; 28 1899_CR14 A Alonso-Ayuso (1899_CR2) 2005; 33 HD Sherali (1899_CR18) 2002; 22 1899_CR20 A Alonso-Ayuso (1899_CR1) 2003; 151 LT Biegler (1899_CR3) 2004; 28 LF Escudero (1899_CR7) 2010; 204 J Stoer (1899_CR19) 1970 LF Escudero (1899_CR6) 2009; 36 1899_CR11 RT Rockafellar (1899_CR15) 1970 S Leyffer (1899_CR13) 2001; 18 S Sen (1899_CR16) 2006; 105 |
| References_xml | – volume: 151 start-page: 503 year: 2003 end-page: 519 ident: CR1 article-title: BFC, a branch-and-fix coordination algorithm framework for solving some types of stochasticpure and mixed 0–1 programs publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00628-8 – year: 1995 ident: CR9 publication-title: Nonlinear and mixed-integer optimization: Fundamentals and applications – volume: 18 start-page: 295 year: 2001 end-page: 309 ident: CR13 article-title: Integrating sqp and branch-and-bound for mixed integer nonlinear programming publication-title: Computational Optimization and Applications doi: 10.1023/A:1011241421041 – volume: 33 start-page: 307 year: 2005 end-page: 318 ident: CR2 article-title: On the product selection and plant dimensioning problem under uncertainty publication-title: Omega doi: 10.1016/j.omega.2004.05.001 – year: 1970 ident: CR15 publication-title: Convex analysis doi: 10.1515/9781400873173 – ident: CR14 – volume: 22 start-page: 319 year: 2002 end-page: 342 ident: CR18 article-title: A modification of bender’s decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse publication-title: Journal of Global Optimization doi: 10.1023/A:1013827731218 – volume: 39 start-page: 1133 issue: 5 year: 2012 end-page: 1144 ident: CR8 article-title: An algorithmic framework for solving large-scale multistage stochastic mixed 0–1 problems with nonsymmetric scenario trees publication-title: Computers & Operations Research doi: 10.1016/j.cor.2011.06.021 – year: 1970 ident: CR19 publication-title: Convexity and optimization in finite dimensions I doi: 10.1007/978-3-642-46216-0 – volume: 14 start-page: 89 year: 1966 end-page: 105 ident: CR21 article-title: Programming under uncertainty: The equivalent convex program publication-title: SIAM Journal on Applied Mathematics doi: 10.1137/0114008 – ident: CR11 – volume: 36 start-page: 2590 year: 2009 end-page: 2600 ident: CR6 article-title: A general algorithm for solving two-stage stochastic mixed 0–1 first-stage problems publication-title: Computers & Operations Research doi: 10.1016/j.cor.2008.11.011 – volume: 50 start-page: 415 year: 2002 end-page: 423 ident: CR12 article-title: An integer l-shaped algorithm for the capacited vehicle routing problem with stochastic demands publication-title: Operations Research doi: 10.1287/opre.50.3.415.7751 – volume: 21 start-page: 359 issue: 4 year: 1994 end-page: 367 ident: CR5 article-title: An improved branch and bound algorithm for mixed integer nonlinear programming publication-title: Computers and Operations Research doi: 10.1016/0305-0548(94)90024-8 – volume: 28 start-page: 1169 year: 2004 end-page: 1192 ident: CR3 article-title: Retrospective on optimization publication-title: Computers & Chemical Engineering doi: 10.1016/j.compchemeng.2003.11.003 – volume: 5 start-page: 186 issue: 2 year: 2008 end-page: 204 ident: CR4 article-title: An algorithmic framework for convex mixed integer nonlinear programs publication-title: Discrete Optimization doi: 10.1016/j.disopt.2006.10.011 – volume: 28 start-page: 1169 year: 2002 end-page: 1192 ident: CR10 article-title: Review of nonlinear mixed-integer and disjunctive programming techniques publication-title: Optimization Engineering – volume: 204 start-page: 105 year: 2010 end-page: 116 ident: CR7 article-title: An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2009.09.027 – volume: 108 start-page: 597 year: 2006 end-page: 616 ident: CR17 article-title: On solving discrete two-stage stochastic program having mixed-integer first- and second-stage variables publication-title: Mathematical Programming Series B doi: 10.1007/s10107-006-0724-6 – volume: 105 start-page: 203 year: 2006 end-page: 223 ident: CR16 article-title: Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming publication-title: Mathematical Programming Series A doi: 10.1007/s10107-005-0592-5 – ident: CR20 – volume-title: Nonlinear and mixed-integer optimization: Fundamentals and applications year: 1995 ident: 1899_CR9 doi: 10.1093/oso/9780195100563.001.0001 – volume: 18 start-page: 295 year: 2001 ident: 1899_CR13 publication-title: Computational Optimization and Applications doi: 10.1023/A:1011241421041 – volume-title: Convexity and optimization in finite dimensions I year: 1970 ident: 1899_CR19 doi: 10.1007/978-3-642-46216-0 – ident: 1899_CR20 doi: 10.1137/1.9780898718799 – volume: 36 start-page: 2590 year: 2009 ident: 1899_CR6 publication-title: Computers & Operations Research doi: 10.1016/j.cor.2008.11.011 – volume: 108 start-page: 597 year: 2006 ident: 1899_CR17 publication-title: Mathematical Programming Series B doi: 10.1007/s10107-006-0724-6 – volume: 22 start-page: 319 year: 2002 ident: 1899_CR18 publication-title: Journal of Global Optimization doi: 10.1023/A:1013827731218 – volume: 21 start-page: 359 issue: 4 year: 1994 ident: 1899_CR5 publication-title: Computers and Operations Research doi: 10.1016/0305-0548(94)90024-8 – volume: 28 start-page: 1169 year: 2002 ident: 1899_CR10 publication-title: Optimization Engineering – volume-title: Convex analysis year: 1970 ident: 1899_CR15 doi: 10.1515/9781400873173 – volume: 151 start-page: 503 year: 2003 ident: 1899_CR1 publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00628-8 – volume: 33 start-page: 307 year: 2005 ident: 1899_CR2 publication-title: Omega doi: 10.1016/j.omega.2004.05.001 – volume: 39 start-page: 1133 issue: 5 year: 2012 ident: 1899_CR8 publication-title: Computers & Operations Research doi: 10.1016/j.cor.2011.06.021 – volume: 50 start-page: 415 year: 2002 ident: 1899_CR12 publication-title: Operations Research doi: 10.1287/opre.50.3.415.7751 – volume: 204 start-page: 105 year: 2010 ident: 1899_CR7 publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2009.09.027 – volume: 5 start-page: 186 issue: 2 year: 2008 ident: 1899_CR4 publication-title: Discrete Optimization doi: 10.1016/j.disopt.2006.10.011 – volume: 105 start-page: 203 year: 2006 ident: 1899_CR16 publication-title: Mathematical Programming Series A doi: 10.1007/s10107-005-0592-5 – ident: 1899_CR14 doi: 10.1007/978-3-642-36062-6_18 – volume: 28 start-page: 1169 year: 2004 ident: 1899_CR3 publication-title: Computers & Chemical Engineering doi: 10.1016/j.compchemeng.2003.11.003 – volume: 14 start-page: 89 year: 1966 ident: 1899_CR21 publication-title: SIAM Journal on Applied Mathematics doi: 10.1137/0114008 – ident: 1899_CR11 doi: 10.1007/978-3-642-36062-6_51 |
| SSID | ssj0001185 |
| Score | 2.154249 |
| Snippet | We present an algorithm to solve two-stage stochastic convex problems, whose objective function and constraints are nonlinear. It is based on the... (ProQuest: ... denotes formulae and/or non-USASCII text omitted; see image) We present an algorithm to solve two-stage stochastic convex problems, whose... (ProQuest: ... denotes formulae and/or non-USASCII text omitted; see image).We present an algorithm to solve two-stage stochastic convex problems, whose... |
| SourceID | proquest gale crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 581 |
| SubjectTerms | Algorithms Approximation Business and Management Combinatorics Convex functions Integer programming Mathematical analysis Mathematical models Mathematical research Nonlinear programming Nonlinearity Operations research Operations Research/Decision Theory Quadratic programming Stochastic processes Stochasticity Strategy Studies Texts Theory of Computation Variables |
| SummonAdditionalLinks | – databaseName: SpringerLINK Contemporary 1997-Present dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3db9MwED_BQAgeGBTQCgMZCYQEspQ4ju08VoiJFybEl_Zm2Y7dVdpa1KRjfz5n1yktXxK85MVnO76cz3fx3e8AntnWNZVtGK2MqClnkkUMyEB5GxxnhWPB2FRsQh4fq5OT5n3O4-6GaPfhSjJp6q1kNy5jbE9NSxVT56_CNTztVKzX8OHjl436RYs5xS2i50Nj6ORwlfm7IXYOo59V8i93o-nIOdr_r5e9A7ezhUkma5G4C1f8fAQ3hgD3EewPhRxI3tcjuLWFSngP3k3mxJxNF8tZf3pO0Kgl_bcFRSty6gmaiu7URGxncj679C1NcBM41nwNuWGWJMWxX5Jcqaa7D5-P3nx6_ZbmqgvUcSV62jCjeOOlCMFLdFqtKCyv6-BQOVgreVO10rNa2dIHNE4kM5x5xaSQrVBemeoB7OGc_gCIsL5k0si6dRWXtlKtCajPQoNuaRSRMRQD-7XLkOSxMsaZ_gGmHPmokY868lEXY3i56fJ1jcfxN-Ln8ZvqXM8TH13849FNzarr9AQtRYHuF2_G8CLRxT2N8zuTUxNwFREda4fycIcS96LbbR6kR2dd0OlSVqIqGdqCY3i6aY49Y3zb3C9WkUaqQqA7iTSvBonaGuJPK3z4T9SP4CZLIhmjcQ5hr1-u_GO47i76Wbd8krbRd0mmFSA priority: 102 providerName: Springer Nature |
| Title | An algorithm for two-stage stochastic mixed-integer nonlinear convex problems |
| URI | https://link.springer.com/article/10.1007/s10479-015-1899-0 https://www.proquest.com/docview/1736312063 https://www.proquest.com/docview/1778060963 |
| Volume | 235 |
| WOSCitedRecordID | wos000365867100026&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1572-9338 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: 7WY dateStart: 19990101 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1572-9338 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: M0C dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1572-9338 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: P5Z dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1572-9338 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: K7- dateStart: 19990101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1572-9338 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: M7S dateStart: 19990101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1572-9338 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: BENPR dateStart: 19990101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Science Database customDbUrl: eissn: 1572-9338 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: M2P dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.proquest.com/sciencejournals providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1572-9338 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 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/eLvHCXMwpV3db9MwED-xDSF4YFBAFEZlJBASyCJxHNt5QmXahIRaVRsfg5fIcZxu0taOpoX9-dylTreC2AsvJ0W52LHufL6zz78DeFGULkuKTPDEqpRLoQVhQFZclpWTInKiskVTbEIPh-boKBuFDbc6pFW2NrEx1OXU0R7521gnKokFrqjvzn9wqhpFp6uhhMYGbKFnE1NK10CMVpYYnecmhRGDIE5ZlO2p5vLqnNSUKZTy2NBF_LV16U_r_NcxabP67G__73_fg7vB72T9paLchxt-0oFbbdp7B7bb8g4szPYO3LmCVfgABv0Js6djbHp-fMbQ1WXzX1OOvuXYM3Qg3bElxGd2dnLhS96AUGBbkyUQh52xJrv9goX6NfVD-Ly_92n3Aw-1GLiTRs15JqyRmdeqqrzGULZQUSHTtHJoMopCyywptRepKWJfocuihZXCG6GVLpXxxiaPYBP79I-BqcLHQludli6RukhMaSu0clWGwSopTheiVhK5C0DlVC_jNL-EWCbh5Si8nISXR114vfrkfInScR3zSxJvHqp8IqlpH6Qe20Vd5330HxUGZTLrwquGj2Y69u9suLCAoyDMrDXOnTVOnKFu_XWrGnmwEHV-qRddeL56TV9S1tvETxfEo02kMMhEnjetAl5p4l8jfHJ9h0_htmgUn5JydmBzPlv4Z3DT_Zyf1LMebOiv33qw9X5vODrAp4-aIx1Eu71mchHVh0hH6XekB4dffgMPMibe |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VgngcKCwgFgoYiQoJZJE4ju0cEFoBVau2qx6K1FvqOM62UrtbNlla_hS_kZk8tl0QvfXAJZdMbDn55hWPvwF4k-UuibJE8MiqmEuhBXFAFlzmhZMicKKwWd1sQg-HZn8_2V2CX91ZGCqr7GxibajziaN_5B9CHakoFOhRP51-59Q1inZXuxYaDSy2_M8zTNnKj5tf8PuuCbH-de_zBm-7CnAnjap4IqyRideqKLzGpCxTQSbjuHAI_izTMoly7UVsstAX6Hy1sFJ4I7TSuTLe2AjHvQE3JTGLUamg2J1bfgzW65JJTLo4VW12u6jNUT2pqTIp5qGhg_8LfvBPb_DXtmzt7dZX_rf39ADut3E1GzSK8BCW_LgHt7uy_h6sdO0rWGvNenDvEhfjI9gZjJk9HuFSqsMThqE8q84mHGPnkWcYILtDS4zW7OTo3Oe8JtnAscYN0Yidsrp6_5y1_XnKx_DtWlb7BJZxTv8UmMp8KLTVce4iqbPI5LZAK14kmIyTYvQh6L586loiduoHcpxeUEgTWFIES0pgSYM-vJs_ctqwkFwlvEZwStsupngp6T9PObKzskwHGB8rTDpl0oe3tRxZMpzf2fZABq6COMEWJFcXJNECucXbHRTT1gKW6QUO-_B6fpuepKq-sZ_MSEabQGESjTLvO8BfGuJfK3x29YSv4M7G3s52ur053HoOd0WtdFSAtArL1XTmX8At96M6Kqcva_VlcHDdevAbzo96xw |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3Nb9MwFH8aA03swKCAKAwwEhMSyFrqOHFyQKhiVEyDqgeQJi7Gcexu0tZuTcrGv8Zfx3v56FYQu-3AJZe82HLye1_xz-8BvMxym4ZZKnho4ohLoQTVgPRc5t5KEVjhTVY1m1DDYbK_n45W4Fd7FoZola1NrAx1PrX0j3y7p8I47An0qNu-oUWMdgbvTk45dZCinda2nUYNkT338wzTt-Lt7g5-6y0hBh--vP_Imw4D3MokLnkqTCJTp2LvncIELYuDTEaRt6gIWaZkGubKiSjJes6jI1bCSOESoWKVx4lLTIjj3oCbCnNMohOOom8LL4CBe0WfxASME4Oz3VGtj-1JRSyliPcSKgKw5BP_9Ax_bdFWnm-w8T-_s7twp4m3Wb9WkHuw4iYdWGvp_h3YaNtasMbKdWD9Uo3G-_C5P2HmaIxLKQ-OGYb4rDybcoypx45h4GwPDFW6ZseH5y7nVfENHGtSFyAxM1ax-s9Z07eneABfr2W1D2EV53SPgMWZ6wllVJTbUKosTHLj0br7FJN0UpguBC0KtG0KtFOfkCN9UVqagKMROJqAo4MuvF48clJXJ7lKeIugpZvupngp6P9PMTbzotB9jJtjTEZl2oVXlRxZOJzfmuagBq6CaoUtSW4uSaJlssu3W1jqxjIW-gKTXXixuE1PEttv4qZzklFJEGNyjTJvWvBfGuJfK3x89YTPYQ3hrz_tDveewG1R6R_xkjZhtZzN3VO4ZX-Uh8XsWaXJDL5ftxr8Bgzfg7M |
| 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+algorithm+for+two-stage+stochastic+mixed-integer+nonlinear+convex+problems&rft.jtitle=Annals+of+operations+research&rft.au=Mijangos%2C+E.&rft.date=2015-12-01&rft.issn=0254-5330&rft.eissn=1572-9338&rft.volume=235&rft.issue=1&rft.spage=581&rft.epage=598&rft_id=info:doi/10.1007%2Fs10479-015-1899-0&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s10479_015_1899_0 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0254-5330&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0254-5330&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0254-5330&client=summon |