找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
查看: 20649|回复: 47
发表于 2025-3-21 16:32:14 | 显示全部楼层 |阅读模式
书目名称Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming
副标题Theory, Algorithms,
编辑Mohit Tawarmalani,Nikolaos V. Sahinidis
视频video
丛书名称Nonconvex Optimization and Its Applications
图书封面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
关键词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

书目名称Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming影响因子(影响力)




书目名称Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming影响因子(影响力)学科排名




书目名称Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming网络公开度




书目名称Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming网络公开度学科排名




书目名称Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming被引频次




书目名称Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming被引频次学科排名




书目名称Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming年度引用




书目名称Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming年度引用学科排名




书目名称Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming读者反馈




书目名称Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:29:33 | 显示全部楼层
发表于 2025-3-22 01:24:34 | 显示全部楼层
发表于 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
发表于 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
发表于 2025-3-22 13:27:19 | 显示全部楼层
发表于 2025-3-22 20:51:04 | 显示全部楼层
发表于 2025-3-23 00:01:02 | 显示全部楼层
发表于 2025-3-23 04:10:11 | 显示全部楼层
发表于 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
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-5 07:54
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表