找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming; Theory, Algorithms, Mohit Tawarmalani,Nikol

[復(fù)制鏈接]
查看: 20729|回復(fù): 47
樓主
發(fā)表于 2025-3-21 16:32:14 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱(chēng)Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming
副標(biāo)題Theory, Algorithms,
編輯Mohit Tawarmalani,Nikolaos V. Sahinidis
視頻videohttp://file.papertrans.cn/238/237855/237855.mp4
叢書(shū)名稱(chēng)Nonconvex Optimization and Its Applications
圖書(shū)封面Titlebook: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming; Theory, Algorithms,  Mohit Tawarmalani,Nikol
描述Interest in constrained optimization originated with the simple linear pro- gramming model since it was practical and perhaps the only computationally 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 assumption of linearity to be overly restrictive in expressing the real-world phenomena and problems in economics, finance, business, communication, engineering design, computational biology, and other areas that frequently demand the use of nonlinear expressions and discrete variables in optimization models. Both of these extensions of the linear programming model are NP-hard, thus representing very challenging problems. On the brighter side, recent advances in algorithmic and computing technology make it possible to re- visit these problems with the hope of solving practically relevant problems in reasonable amounts of computational time. Initial attempts at solving nonlinear programs concentrated on the de- velopment of local optimization methods guarant
出版日期Book 2002
關(guān)鍵詞Partition; algorithm; algorithms; global optimization; linear optimization; model; nonlinear optimization;
版次1
doihttps://doi.org/10.1007/978-1-4757-3532-1
isbn_softcover978-1-4419-5235-6
isbn_ebook978-1-4757-3532-1Series ISSN 1571-568X
issn_series 1571-568X
copyrightSpringer Science+Business Media Dordrecht 2002
The information of publication is updating

書(shū)目名稱(chēng)Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming影響因子(影響力)




書(shū)目名稱(chēng)Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming被引頻次




書(shū)目名稱(chēng)Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming被引頻次學(xué)科排名




書(shū)目名稱(chēng)Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming年度引用




書(shū)目名稱(chēng)Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming年度引用學(xué)科排名




書(shū)目名稱(chēng)Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming讀者反饋




書(shū)目名稱(chēng)Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:29:33 | 只看該作者
板凳
發(fā)表于 2025-3-22 01:24:34 | 只看該作者
地板
發(fā)表于 2025-3-22 08:30:17 | 只看該作者
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
5#
發(fā)表于 2025-3-22 10:58:13 | 只看該作者
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
6#
發(fā)表于 2025-3-22 13:27:19 | 只看該作者
7#
發(fā)表于 2025-3-22 20:51:04 | 只看該作者
8#
發(fā)表于 2025-3-23 00:01:02 | 只看該作者
9#
發(fā)表于 2025-3-23 04:10:11 | 只看該作者
10#
發(fā)表于 2025-3-23 07:18:39 | 只看該作者
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
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-29 15:53
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
固阳县| 葵青区| 奈曼旗| 孟州市| 泰顺县| 惠东县| 蒙阴县| 西丰县| 侯马市| 屯昌县| 宝清县| 玉树县| 方城县| 金坛市| 凤庆县| 尼勒克县| 津南区| 广汉市| 庆元县| 澎湖县| 谷城县| 汾阳市| 柯坪县| 大邑县| 右玉县| 邵阳县| 玛曲县| 普陀区| 竹溪县| 镇安县| 乾安县| 宁阳县| 江北区| 昭苏县| 镇江市| 车致| 五台县| 祁阳县| 舒城县| 武强县| 响水县|