Although this textbook is intended for use in a two-semester sequence of courses introducing the mathematical methods of operations research, Part I can also be used alone for a one-semester course on linear programming. The authors have chosen to provide deep and thorough coverage of the most important methods in operations research, rather than a superficial treatment of a larger number of topics. The level of exposition is appropriate for juniors and seniors who are majoring in engineering, computer science, mathematics, and quantitative methods in management

Introduction. LINEAR PROGRAMMING. Linear Programming Models and Applications. The Simplex Algorithm for Linear Programming. Geometry of the Simplex Algorithm. Duality in Linear Programming. Sensitivity Analysis in Linear Programming. Linear Programming Models for Network Flow Problems. INTEGER, NONLINEAR AND DYNAMIC PROGRAMMING. Integer Programming. Nonlinear Programming. Dynamic Programming. PROBABILISTIC MODELS. Queuing Models. Inventory Models. Simulation. Appendix. Notational Conventions for Matrix Algebra. Selected References. Answers to Selected Exercises. Index.

등록된 사용후기

사용후기 쓰기 새 창 더보기

사용후기가 없습니다.

등록된 상품문의

상품문의 쓰기새 창 더보기

상품문의가 없습니다.

배송정보

교환/반품 정보