Logo

Applied Mathematical Programming

Small book cover: Applied Mathematical Programming

Applied Mathematical Programming
by

Publisher: Addison-Wesley
ISBN/ASIN: 020100464X
ISBN-13: 9780201004649
Number of pages: 716

Description:
This book shows you how to model a wide array of problems, and explains the mathematical algorithms and techniques behind the modeling. Covered are topics such as linear programming, duality theory, sensitivity analysis, network/dynamic programming, integer programming, non-linear programming, and my favorite, large-scale problems modeling/solving, etc.

Home page url

Download or read it online for free here:
Download link
(multiple PDF files)

Similar books

Book cover: Optimization Algorithms: Methods and ApplicationsOptimization Algorithms: Methods and Applications
by - InTech
This book covers state-of-the-art optimization methods and their applications in wide range especially for researchers and practitioners who wish to improve their knowledge in this field. It covers applications in engineering and various other areas.
(7094 views)
Book cover: Applied Mathematical Programming Using Algebraic SystemsApplied Mathematical Programming Using Algebraic Systems
by - Texas A&M University
This book is intended to both serve as a reference guide and a text for a course on Applied Mathematical Programming. The text concentrates upon conceptual issues, problem formulation, computerized problem solution, and results interpretation.
(12327 views)
Book cover: Decision Making and Productivity MeasurementDecision Making and Productivity Measurement
by - arXiv
I wrote this book as a self-teaching tool to assist every teacher, student, mathematician or non-mathematician, and to support their understanding of the elementary concepts on assessing the performance of a set of homogenous firms ...
(6634 views)
Book cover: The Design of Approximation AlgorithmsThe Design of Approximation Algorithms
by - Cambridge University Press
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.
(15886 views)