| 書目名稱 | In-Depth Analysis of Linear Programming | | 編輯 | F. P. Vasilyev,A. Yu. Ivanitskiy | | 視頻video | http://file.papertrans.cn/464/463135/463135.mp4 | | 圖書封面 |  | | 描述 | Along with the traditional material concerning linearprogramming (the simplex method, the theory of duality, the dualsimplex method), .In-Depth Analysis of Linear Programming.contains new results of research carried out by the authors. .For the first time, the criteria of stability (in the geometrical andalgebraic forms) of the general linear programming problem areformulated and proved. New regularization methods based on the idea ofextension of an admissible set are proposed for solving unstable(ill-posed) linear programming problems. In contrast to the well-knownregularization methods, in the methods proposed in this book theinitial unstable problem is replaced by a new stable auxiliaryproblem. This is also a linear programming problem, which can besolved by standard finite methods. In addition, the authors indicatethe conditions imposed on the parameters of the auxiliary problemwhich guarantee its stability, and this circumstance advantageouslydistinguishes the regularization methods proposed in this book fromthe existing methods. In these existing methods, the stability of theauxiliary problem is usually only presupposed but is not explicitlyinvestigated. .In this book, the tr | | 出版日期 | Book 2001 | | 關(guān)鍵詞 | Notation; duality; linear optimization | | 版次 | 1 | | doi | https://doi.org/10.1007/978-94-015-9759-3 | | isbn_softcover | 978-90-481-5851-5 | | isbn_ebook | 978-94-015-9759-3 | | copyright | Springer Science+Business Media Dordrecht 2001 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2026-2-6 22:47
發(fā)表于 2025-3-21 16:19:24
