標(biāo)題: Titlebook: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming; Theory, Algorithms, Mohit Tawarmalani,Nikol [打印本頁] 作者: emanate 時間: 2025-3-21 16:32
書目名稱Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming影響因子(影響力)
書目名稱Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming影響因子(影響力)學(xué)科排名
書目名稱Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming網(wǎng)絡(luò)公開度
書目名稱Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming被引頻次
書目名稱Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming被引頻次學(xué)科排名
書目名稱Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming年度引用
書目名稱Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming年度引用學(xué)科排名
書目名稱Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming讀者反饋
書目名稱Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming讀者反饋學(xué)科排名
作者: Derogate 時間: 2025-3-21 21:29 作者: faculty 時間: 2025-3-22 01:24 作者: 健壯 時間: 2025-3-22 08:30
Relaxations of Factorable Programs, relaxations can be exponential in the number of variables. In this chapter, we present a slightly modified version of the factorable programming technique due to McCormick (1976) that, when used in conjunction with our relaxation techniques, constructs relaxations that are tight as well as manageab作者: Adulterate 時間: 2025-3-22 10:58
Domain Reduction, a global optimum. Domain reduction is also referred to as bounds tightening, domain contraction, and range reduction. Various techniques for domain reduction have been developed by Mangasarian & McLinden (1985), Thakur (1990), Hansen, Jaumard & Lu (1991), Hamed & McCormick (1993), Lamar (1993), Sav作者: Verify 時間: 2025-3-22 13:27 作者: Verify 時間: 2025-3-22 20:51 作者: infarct 時間: 2025-3-23 00:01 作者: 使人入神 時間: 2025-3-23 04:10 作者: encomiast 時間: 2025-3-23 07:18
Miscellaneous Problems,rograms, indefinite quadratic programs, linear multiplicative programs, univariate polynomial programs, and benchmark problems from diverse application areas. All problems were solved to global optimality with an absolute tolerance of 10. unless otherwise specified. Our computational experience demo作者: 注入 時間: 2025-3-23 10:14 作者: 高貴領(lǐng)導(dǎo) 時間: 2025-3-23 17:24 作者: 不能根除 時間: 2025-3-23 21:29
,Hygiene des S?uglings in den heissen Tagen,In particular, we apply product disaggregation to develop eight different mixed-integer convex programming reformulations of 0–1 hyperbolic programs. We obtain analytical results on the relative tightness of these formulations and propose a branch-and-bound algorithm for 0–1 hyperbolic programs. The作者: 教唆 時間: 2025-3-24 01:03 作者: ARM 時間: 2025-3-24 02:57 作者: 飲料 時間: 2025-3-24 09:33 作者: 并排上下 時間: 2025-3-24 12:58 作者: Texture 時間: 2025-3-24 15:14
Product Disaggregation in Global Optimization and Relaxations of Rational Programs,In particular, we apply product disaggregation to develop eight different mixed-integer convex programming reformulations of 0–1 hyperbolic programs. We obtain analytical results on the relative tightness of these formulations and propose a branch-and-bound algorithm for 0–1 hyperbolic programs. The作者: SOB 時間: 2025-3-24 21:27 作者: 后退 時間: 2025-3-25 02:17 作者: 神圣不可 時間: 2025-3-25 04:15
Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear ProgrammingTheory, Algorithms, 作者: 小母馬 時間: 2025-3-25 09:50 作者: geometrician 時間: 2025-3-25 12:01
Relaxations of Factorable Programs,le in size and can be generated in an automated fashion. To enable the use of efficient LP software, in Section 4.2 we build linear programming relaxations of the nonlinear convex relaxations using the sandwich algorithm (Rote 1992).作者: 準(zhǔn)則 時間: 2025-3-25 16:57 作者: 上釉彩 時間: 2025-3-25 22:09
Node Partitioning Schemes,ut it is found to be practically efficient as well. In the second part of this chapter, we study finiteness issues for branch-and-bound. In particular, we develop a finite branching scheme for stochastic two-stage integer programs with pure-integer recourse.作者: Ornament 時間: 2025-3-26 00:45
Miscellaneous Problems,n areas. All problems were solved to global optimality with an absolute tolerance of 10. unless otherwise specified. Our computational experience demonstrates that it is now possible to solve (mixed-integer) nonlinear optimization problems to global optimality in an automated fashion with reasonable computational resources.作者: 誹謗 時間: 2025-3-26 08:01
Vorwort und Einführung zum Gesamtwerkle in size and can be generated in an automated fashion. To enable the use of efficient LP software, in Section 4.2 we build linear programming relaxations of the nonlinear convex relaxations using the sandwich algorithm (Rote 1992).作者: gout109 時間: 2025-3-26 12:02
Vorwort und Einführung zum Gesamtwerk implementing BARON. This chapter also highlights some useful enhancements to the branch-and-bound algorithm. Throughout this chapter, we assume that the problem being solved is a minimization problem.作者: Flustered 時間: 2025-3-26 16:28
1571-568X tationally tractable model at the time. Constrained linear optimization models were soon adopted in numerous application areas and are perhaps the most widely used mathematical models in operations research and management science at the time of this writing. Modelers have, however, found the assumpt作者: 對待 時間: 2025-3-26 20:52 作者: 繼承人 時間: 2025-3-26 22:36
Vorwort und Einführung zum Gesamtwerkn areas. All problems were solved to global optimality with an absolute tolerance of 10. unless otherwise specified. Our computational experience demonstrates that it is now possible to solve (mixed-integer) nonlinear optimization problems to global optimality in an automated fashion with reasonable computational resources.作者: ironic 時間: 2025-3-27 05:11
,Die Ern?hrung des S?uglings an der Brust,globality under certain convexity assumptions (cf. Minoux 1986, Bazaraa, Sherali & Shetty 1993) However, problems in many areas, including engineering design, logistics, manufacturing, and the chemical and biological sciences are often modeled via nonconvex formulations and exhibit multiple local optima.作者: minaret 時間: 2025-3-27 09:15
https://doi.org/10.1007/978-3-662-29489-5 We develop a theory of domain reduction in this chapter and then derive earlier results in the light of these new developments. For example, our results generalize to the nonlinear case, range reduction tests used in the integer linear programming literature.作者: endocardium 時間: 2025-3-27 11:15
https://doi.org/10.1007/978-3-662-29489-5ck & Stephanopoulos (1990) In addition to rediscovering CFCs, the proposed methodology identifies a number of novel potential replacements of .. All of the identified alternatives are predicted to possess thermodynamic properties that would result in a more efficient refrigeration cycle than obtained via the use of ..作者: 憤世嫉俗者 時間: 2025-3-27 16:39 作者: 其他 時間: 2025-3-27 18:11 作者: 疼死我了 時間: 2025-3-27 22:54
Refrigerant Design Problem,ck & Stephanopoulos (1990) In addition to rediscovering CFCs, the proposed methodology identifies a number of novel potential replacements of .. All of the identified alternatives are predicted to possess thermodynamic properties that would result in a more efficient refrigeration cycle than obtained via the use of ..作者: 我們的面粉 時間: 2025-3-28 04:38 作者: 蚊帳 時間: 2025-3-28 06:44
https://doi.org/10.1007/978-1-4757-3532-1Partition; algorithm; algorithms; global optimization; linear optimization; model; nonlinear optimization; 作者: ETHER 時間: 2025-3-28 13:39
978-1-4419-5235-6Springer Science+Business Media Dordrecht 2002作者: 保全 時間: 2025-3-28 16:11
Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming978-1-4757-3532-1Series ISSN 1571-568X 作者: fidelity 時間: 2025-3-28 21:15 作者: 設(shè)施 時間: 2025-3-29 02:36
,Hygiene des S?uglings in den heissen Tagen,In this chapter, we develop the theory of convex extensions of lower semicontinuous (l.s.c.) functions and illustrate its use in building convex envelopes of nonconvex mathematical programs. The techniques developed here amount to a recipe that can be used to construct closed-form expressions of con作者: 氣候 時間: 2025-3-29 05:14
,Hygiene des S?uglings in den heissen Tagen,regation” (distributing the product over the sum) leads to tighter linear programming relaxations, much like variable disaggregation does in mixedinteger linear programming. We also derive closed-form expressions characterizing the exact region over which these relaxations improve when the bounds of作者: cogent 時間: 2025-3-29 09:55 作者: 清洗 時間: 2025-3-29 14:59 作者: 反對 時間: 2025-3-29 19:04
Vorwort und Einführung zum Gesamtwerk to develop a partitioning technique for factorable programs. Not only does this partitioning scheme lead to a convergent branch-and-bound algorithm but it is found to be practically efficient as well. In the second part of this chapter, we study finiteness issues for branch-and-bound. In particular作者: GRIPE 時間: 2025-3-29 21:59
