Applied Mathematical Programming Using Algebraic Systems
by Bruce A. McCarl, Thomas H. Spreen
Publisher: Texas A&M University 2011
Number of pages: 567
Description:
This book is intended to both serve as a reference guide and a text for a course on Applied Mathematical Programming. The material presented will concentrate upon conceptual issues, problem formulation, computerized problem solution, and results interpretation. Solution algorithms will be treated only to the extent necessary to interpret solutions and overview events that may occur during the solution process.
Download or read it online for free here:
Download link
(1.7MB, PDF)
Similar books
Optimization Algorithms: Methods and Applications
by Ozgur Baskan (ed.) - 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.
(7791 views)
by Ozgur Baskan (ed.) - 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.
(7791 views)
A Practical Guide to Robust Optimization
by Bram L. Gorissen, Ihsan Yanıkoğlu, Dick den Hertog - arXiv
The aim of this paper is to help practitioners to understand robust optimization and to successfully apply it in practice. We provide a brief introduction to robust optimization, and also describe important do's and don'ts for using it in practice.
(7836 views)
by Bram L. Gorissen, Ihsan Yanıkoğlu, Dick den Hertog - arXiv
The aim of this paper is to help practitioners to understand robust optimization and to successfully apply it in practice. We provide a brief introduction to robust optimization, and also describe important do's and don'ts for using it in practice.
(7836 views)
The Design of Approximation Algorithms
by D. P. Williamson, D. B. Shmoys - 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.
(16735 views)
by D. P. Williamson, D. B. Shmoys - 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.
(16735 views)
Linear Programming
by Jim Burke - University of Washington
These are notes for an introductory course in linear programming. The four basic components of the course are modeling, solution methodology, duality theory, and sensitivity analysis. We focus on the simplex algorithm due to George Dantzig.
(8540 views)
by Jim Burke - University of Washington
These are notes for an introductory course in linear programming. The four basic components of the course are modeling, solution methodology, duality theory, and sensitivity analysis. We focus on the simplex algorithm due to George Dantzig.
(8540 views)