找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Computational Mathematical Programming; K. L. Hoffman,R. H. F. Jackson,J. Telgen Book 1987Latest edition Springer-Verlag Berlin Heidelberg

[复制链接]
查看: 33729|回复: 51
发表于 2025-3-21 17:26:13 | 显示全部楼层 |阅读模式
书目名称Computational Mathematical Programming
编辑K. L. Hoffman,R. H. F. Jackson,J. Telgen
视频videohttp://file.papertrans.cn/233/232037/232037.mp4
丛书名称Mathematical Programming Studies
图书封面Titlebook: Computational Mathematical Programming;  K. L. Hoffman,R. H. F. Jackson,J. Telgen Book 1987Latest edition Springer-Verlag Berlin Heidelberg
出版日期Book 1987Latest edition
关键词Mathematica; optimization; programming
版次1
doihttps://doi.org/10.1007/BFb0121175
isbn_ebook978-3-642-00933-4Series ISSN 0303-3929 Series E-ISSN 2364-8201
issn_series 0303-3929
copyrightSpringer-Verlag Berlin Heidelberg 1987
The information of publication is updating

书目名称Computational Mathematical Programming影响因子(影响力)




书目名称Computational Mathematical Programming影响因子(影响力)学科排名




书目名称Computational Mathematical Programming网络公开度




书目名称Computational Mathematical Programming网络公开度学科排名




书目名称Computational Mathematical Programming被引频次




书目名称Computational Mathematical Programming被引频次学科排名




书目名称Computational Mathematical Programming年度引用




书目名称Computational Mathematical Programming年度引用学科排名




书目名称Computational Mathematical Programming读者反馈




书目名称Computational Mathematical Programming读者反馈学科排名




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

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

1票 100.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:01:41 | 显示全部楼层
发表于 2025-3-22 03:44:37 | 显示全部楼层
发表于 2025-3-22 07:54:19 | 显示全部楼层
Computer-assisted analysis for diagnosing infeasible or unbounded linear programs,nalysis, after the difficulty has been detected, or for preventive analysis. The first method is by successive reduction of bounds on primal quantities and dual prices. This is the most commonly used method in practice due to the availability of REDUCE procedures in commercial mathematical programmi
发表于 2025-3-22 11:16:59 | 显示全部楼层
Restricted simplicial decomposition: Computation and extensions,ignment problem and other network flow problems. The “restricted” version of this method allows the user to treat the maximum size of the generated simplices as a parameter. When the parameter is at its minimum value, the method reduces to the Frank-Wolfe algorithm; when at its maximum, the original
发表于 2025-3-22 14:36:39 | 显示全部楼层
发表于 2025-3-22 19:28:14 | 显示全部楼层
A new algorithm for highly curved constrained optimisation, both the objective function and constraints. At every iteration a subproblem based on the second order approximation of the objective and constraints functions is solved. Three strategies to solve the subproblem are used. Some computational results are given. Although the performance of the subrout
发表于 2025-3-22 21:40:31 | 显示全部楼层
An implementation of an algorithm for univariate minimization and an application to nested optimizating of the corresponding FORTRAN subroutine PQ1, an explanation of its general use and a description of its particular use in solving a practical resource allocation problem via a dual technique requiring nested optimization.
发表于 2025-3-23 01:53:45 | 显示全部楼层
发表于 2025-3-23 07:16:57 | 显示全部楼层
Restricted simplicial decomposition: Computation and extensions,, and linearly constrained problems of the Colville study..Conditions are given for which RSD converges after a finite number of major cycles, and variations of RSD which have potential for real-world applications are developed. These include a quadratic approximation of the master problem and an ex
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-18 18:22
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表