數(shù)學(xué)規(guī)劃導(dǎo)論

內(nèi)容概要

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

書籍目錄

1. Introduction to the Problems.   1.1 Introduction   1.2 Types of problems to be considered  1.3 Sample problems  1.4 Sample problems  1.5 Summary and objectives2. 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 objectives3. 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 minimizing problems  3.8 Sensitivity analysis  3.9 summary and objectives4. 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 Summary and objectives5. Unconstrained Extrema.   ……6. Constrained Extrema. 7. Integer Programming. 8. Introduction to Dynamic Programming. 9. Case Studies. Appendix A.Brief Introductions to LINDO and LINGO.Appendix B.A Brief Introduction to Maple. Appendix C.Introduction to Texas Instrument Calculators. Appendix D.Selected Answers and Hints. References. Index.

圖書封面

圖書標(biāo)簽Tags

無

評論、評分、閱讀與下載

---

    數(shù)學(xué)規(guī)劃導(dǎo)論 PDF格式下載

---