找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Linear Programming Computation; Ping-Qi PAN Book 2023Latest edition The Editor(s) (if applicable) and The Author(s), under exclusive licen

[复制链接]
查看: 33420|回复: 59
发表于 2025-3-21 17:00:10 | 显示全部楼层 |阅读模式
书目名称Linear Programming Computation
编辑Ping-Qi PAN
视频video
概述A landmark work on LP.An updated edition with important improvements.A must-read for students, researchers, and practitioners interested in LP and related areas
图书封面Titlebook: Linear Programming Computation;  Ping-Qi PAN Book 2023Latest edition The Editor(s) (if applicable) and The Author(s), under exclusive licen
描述.This monograph represents a historic breakthrough in the field of linear programming (LP)since George Dantzig first discovered the simplex method in 1947...Being both thoughtful and informative, it focuses on reflecting and promoting the state of the art by highlighting new achievements in LP. This new edition is organized in two volumes. The first volume addresses foundations of LP, including the geometry of feasible region, the simplex method and its implementation, duality and the dual simplex method, the primal-dual simplex method, sensitivity analysis and parametric LP, the generalized simplex method, the decomposition method, the interior-point method and integer LP method. The second volume mainly introduces contributions of the author himself, such as efficient primal/dual pivot rules, primal/dual Phase-I methods, reduced/D-reduced simplex methods, the generalized reduced simplex method, primal/dual deficient-basis methods, primal/dual face methods, a new decomposition principle, etc..Many important improvements were made in this edition. The first volume includes new results, such as the mixed two-phase simplex algorithm, dual elimination, fresh pricing scheme for reduced
出版日期Book 2023Latest edition
关键词deficient-basis method; duality and dual simplex method; face method; linear programming; reduced simple
版次2
doihttps://doi.org/10.1007/978-981-19-0147-8
isbn_softcover978-981-19-0149-2
isbn_ebook978-981-19-0147-8
copyrightThe Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapor
The information of publication is updating

书目名称Linear Programming Computation影响因子(影响力)




书目名称Linear Programming Computation影响因子(影响力)学科排名




书目名称Linear Programming Computation网络公开度




书目名称Linear Programming Computation网络公开度学科排名




书目名称Linear Programming Computation被引频次




书目名称Linear Programming Computation被引频次学科排名




书目名称Linear Programming Computation年度引用




书目名称Linear Programming Computation年度引用学科排名




书目名称Linear Programming Computation读者反馈




书目名称Linear Programming Computation读者反馈学科排名




单选投票, 共有 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 20:19:37 | 显示全部楼层
978-981-19-0149-2The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapor
发表于 2025-3-22 03:57:06 | 显示全部楼层
发表于 2025-3-22 05:26:48 | 显示全部楼层
Implementation of Simplex MethodAll algorithms formulated in this book, such as the simplex algorithm and the dual simplex algorithm, are theoretical or conceptual and cannot be put into use directly. Software, resulting by the following algorithms, step by step would solve textbook instances only. Implementation techniques are crucial to the success of optimization methods.
发表于 2025-3-22 12:28:26 | 显示全部楼层
发表于 2025-3-22 14:16:27 | 显示全部楼层
Decomposition MethodSolving large-scale LP problems is a challenging task, putting forward high requirements on the algorithms’ efficiency, storage, and numerical stability. The decomposition method divides a large-scale LP problem into relatively small ones to cope with normal LP solvers.
发表于 2025-3-22 19:27:50 | 显示全部楼层
Interior-Point MethodAs it is known, the simplex method moves on the underlying polyhedron, from vertex to adjacent vertex along edges, until attaining an optimal vertex unless the lower unboundedness is detected. Nevertheless, it could go through an exponential number of vertices of the polyhedron and even stay at a vertex forever because of cycling (Sect. .).
发表于 2025-3-22 21:50:43 | 显示全部楼层
发表于 2025-3-23 01:54:32 | 显示全部楼层
发表于 2025-3-23 09:20:16 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-25 02:20
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表