國立虎尾科技大學 |

Linear Programming = Foundations and Extensions /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Linear Programming/ by Robert J. Vanderbei.
其他題名:	Foundations and Extensions /
作者:	Vanderbei, Robert J.
面頁冊數:	XXV, 471 p. 182 illus., 109 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Software Engineering/Programming and Operating Systems. -
電子資源:	https://doi.org/10.1007/978-3-030-39415-8
ISBN:	9783030394158

Linear Programming = Foundations and Extensions /
Vanderbei, Robert J.

Linear ProgrammingFoundations and Extensions /[electronic resource] :by Robert J. Vanderbei. - 5th ed. 2020. - XXV, 471 p. 182 illus., 109 illus. in color.online resource. - International Series in Operations Research & Management Science,2850884-8289 ;. - International Series in Operations Research & Management Science,227.

Chapter 1. Introduction -- Chapter 2. The Simplex Method -- Chapter 3. Degeneracy -- Chapter 4. Efficiency of the Simplex Method -- Chapter 5. Duality Theory -- Chapter 6. The Simplex Method in Matrix Notational -- Chapter 7. Sensitivity and Parametric Analyses -- Chapter 8. Implementation Issues -- Chapter 9. Problems in General Form -- Chapter 10. Convex Analysis -- Chapter 11. Game Theory -- Chapter 12. Data Science Applications -- Chapter 13. Financial Applications -- Chapter 14. Network Flow Problems -- Chapter 15. Applications -- Chapter 16. Structural Optimization -- Chapter 17. The Central Path -- Chapter 18. A Path-Following Method -- Chapter 19. The KKT System -- Chapter 20. Implementation Issues -- Chapter 21. The Affine-Scaling Method -- Chapter 22. The Homogeneous Self-Dual Method -- Chapter 23. Integer Programming -- Chapter 24. Quadratic Programming -- Chapter 25. Convex Programming.

The book provides a broad introduction to both the theory and the application of optimization with a special emphasis on the elegance, importance, and usefulness of the parametric self-dual simplex method. The book assumes that a problem in “standard form,” is a problem with inequality constraints and nonnegative variables. The main new innovation to the book is the use of clickable links to the (newly updated) online app to help students do the trivial but tedious arithmetic when solving optimization problems. The latest edition now includes: a discussion of modern Machine Learning applications, as motivational material; a section explaining Gomory Cuts and an application of integer programming to solve Sudoku problems. Readers will discover a host of practical business applications as well as non-business applications. Topics are clearly developed with many numerical examples worked out in detail. Specific examples and concrete algorithms precede more abstract topics. With its focus on solving practical problems, the book features free C programs to implement the major algorithms covered, including the two-phase simplex method, the primal-dual simplex method, the path-following interior-point method, and and the homogeneous self-dual method. In addition, the author provides online tools that illustrate various pivot rules and variants of the simplex method, both for linear programming and for network flows. These C programs and online pivot tools can be found on the book's website. The website also includes new online instructional tools and exercises.

ISBN: 9783030394158

Standard No.: 10.1007/978-3-030-39415-8doiSubjects--Topical Terms:

669780
Software Engineering/Programming and Operating Systems.

LC Class. No.: HD30.23

Dewey Class. No.: 658.40301

Linear Programming = Foundations and Extensions /
LDR:03982nam a22004215i 4500 001 1021708
003 DE-He213
005 20200629153434.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030394158 $9 978-3-030-39415-8
024 7 $a 10.1007/978-3-030-39415-8 $2 doi
035 $a 978-3-030-39415-8
050 4 $a HD30.23
072 7 $a KJT $2 bicssc
072 7 $a BUS049000 $2 bisacsh
072 7 $a KJT $2 thema
072 7 $a KJMD $2 thema
082 0 4 $a 658.40301 $2 23
100 1 $a Vanderbei, Robert J. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 677335
245 1 0 $a Linear Programming $h [electronic resource] : $b Foundations and Extensions / $c by Robert J. Vanderbei.
250 $a 5th ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a XXV, 471 p. 182 illus., 109 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a International Series in Operations Research & Management Science, $x 0884-8289 ; $v 285
505 0 $a Chapter 1. Introduction -- Chapter 2. The Simplex Method -- Chapter 3. Degeneracy -- Chapter 4. Efficiency of the Simplex Method -- Chapter 5. Duality Theory -- Chapter 6. The Simplex Method in Matrix Notational -- Chapter 7. Sensitivity and Parametric Analyses -- Chapter 8. Implementation Issues -- Chapter 9. Problems in General Form -- Chapter 10. Convex Analysis -- Chapter 11. Game Theory -- Chapter 12. Data Science Applications -- Chapter 13. Financial Applications -- Chapter 14. Network Flow Problems -- Chapter 15. Applications -- Chapter 16. Structural Optimization -- Chapter 17. The Central Path -- Chapter 18. A Path-Following Method -- Chapter 19. The KKT System -- Chapter 20. Implementation Issues -- Chapter 21. The Affine-Scaling Method -- Chapter 22. The Homogeneous Self-Dual Method -- Chapter 23. Integer Programming -- Chapter 24. Quadratic Programming -- Chapter 25. Convex Programming.
520 $a The book provides a broad introduction to both the theory and the application of optimization with a special emphasis on the elegance, importance, and usefulness of the parametric self-dual simplex method. The book assumes that a problem in “standard form,” is a problem with inequality constraints and nonnegative variables. The main new innovation to the book is the use of clickable links to the (newly updated) online app to help students do the trivial but tedious arithmetic when solving optimization problems. The latest edition now includes: a discussion of modern Machine Learning applications, as motivational material; a section explaining Gomory Cuts and an application of integer programming to solve Sudoku problems. Readers will discover a host of practical business applications as well as non-business applications. Topics are clearly developed with many numerical examples worked out in detail. Specific examples and concrete algorithms precede more abstract topics. With its focus on solving practical problems, the book features free C programs to implement the major algorithms covered, including the two-phase simplex method, the primal-dual simplex method, the path-following interior-point method, and and the homogeneous self-dual method. In addition, the author provides online tools that illustrate various pivot rules and variants of the simplex method, both for linear programming and for network flows. These C programs and online pivot tools can be found on the book's website. The website also includes new online instructional tools and exercises.
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 669780
650 2 4 $a Optimization. $3 669174
650 1 4 $a Operations Research/Decision Theory. $3 669176
650 0 $a Software engineering. $3 562952
650 0 $a Mathematical optimization. $3 527675
650 0 $a Decision making. $3 528319
650 0 $a Operations research. $3 573517
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030394141
776 0 8 $i Printed edition: $z 9783030394165
776 0 8 $i Printed edition: $z 9783030394172
830 0 $a International Series in Operations Research & Management Science, $x 0884-8289 ; $v 227 $3 1254441
856 4 0 $u https://doi.org/10.1007/978-3-030-39415-8
912 $a ZDB-2-BUM
912 $a ZDB-2-SXBM
950 $a Business and Management (SpringerNature-41169)
950 $a Business and Management (R0) (SpringerNature-43719)