數(shù)學規(guī)劃導論：英文版

定　價：￥65.00

作　者：	（美）拉塞爾·C.沃克（Russell C.Walker）著
出版社：	機械工業(yè)出版社
叢編項：	經典原版書庫
標　簽：	暫缺

購買這本書可以去

ISBN：	9787111158905	出版時間：	2005-01-01	包裝：	膠版紙
開本：	24cm	頁數(shù)：	546	字數(shù)：

內容簡介

　　本書提供了利用數(shù)學規(guī)劃作為工具所必需的背景知識，并討論了與應用技術有關的數(shù)學方法。本書包含線性規(guī)劃、整型規(guī)劃、動態(tài)規(guī)劃、經典的優(yōu)化技術，在向量和矩陣運算以及非線性規(guī)劃中應用符號軟件包Maple，應用Maple進行曲線擬合，解決網絡問題和線性規(guī)劃問題，應用最優(yōu)化軟件包LINDO和LINGO的實例，以及TI-82和TI-92繪圖計算軟件的用法。本書適合作為管理科學和運籌學等專業(yè)的教材，也可作為MBA的教材。本書特點 ●包含利用最優(yōu)化軟件包LINDO和LINGO的示例。 ●介紹TI-82和TI-92繪圖計算軟件。 ●包含大量例題與習題，有助于加深讀者對數(shù)學規(guī)劃的理解。 ●提供許多目前頗具挑戰(zhàn)性的問題的解決途徑。

作者簡介

暫缺《數(shù)學規(guī)劃導論：英文版》作者簡介

圖書目錄

1  Introduction to the Problems
1.1  Introduction
1.2  Types of problems to be considered
1.3  Sample problems
1.4  Graphical solution of linear programs
1.5  Summary and objectives
2  Vectors and Matrices
2.1  Introduction
2.2  Vectors
2.3  The span of a set of vectors
2.4  Matrices
2.5  Linear independence
2.6  Systems of equations
2.7  The inverse of a matrix
2.8  Summary and objectives
3  Linear Programming
3.1  Introduction
3.2  Slack variables
3.3  The simplex algorithm
3.4  Basic feasible solutions and extreme points
3.5  Formulation examples
3.6  General constraints and variables
3.7  The dual and minlmizing problems
3.8  Sensitivity analysis
3.9  Summary and objectives
4  Network Models
4.1  Introduction
4.2  The transportation problem
4.3  The critical path method
4.4  Shortest path models
4.5  Minimal spanning trees
4.6  Snmmary and objectives
5  Unconstrained Extrema
5.1  Introduction
5.2  Locating extrema
5.3  The economic lot size model and convexity
5.4  Location of extrema in two variables
5.5  Least squares approximation
5.6  The n-variable case
5.7  Summary and objectives
6  ConstrAined Extrema
6.1  Introduction
6.2  Two variable problems
6.3  More variables; more constraints
6.4  Problems having inequality constraints
6.5  The convex programming problem
6.6  Linear programming revisited
6.7  Summary and objectives
7  Integer ProgrAmming
7.1  Introduction
7.2  The knapsack problem
7.3  The dual simplex algorithm
7.4  Adding a constraint
7.5  Branch and bound for integer programs
7.6  Basic integer programming models
7.7  The traveling salesman problem
7.8  Summary and objectives
8  Introduction to Dynamic Programming
8.1  Introduction to recursion
8.2  The longest path
8.3  A fixed cost transportation problem
8.4  More examples
8.5  Summary and objectives
9  Case Studies
9.1  Tweaking Widget's production
9.2  A furniture sales opportunity
9.3  Buildlng storage lockers
9.4  The McIntire farm
9.5  Cylinders for beverages
9.6  Books by the holidays
9.7  Into a blind trust
9.8  Max's taxes
9.9  A supply network
A Brief Introductions to LINDO and LINGO
A.1 LINDO
A.2 LINGO
B A Brief Introduction to Maple
B.1 The basics
B.2 Using packages
C Introduction to Texas Tnstrnments Calculators
C.1 A Brief Introduction to the TI-82
C.2 A Brief Introduction to the TI-92
D Selected Answers and Hints
References
Index
</font>