Logo

Applied Mathematical Programming Using Algebraic Systems

Small book cover: Applied Mathematical Programming Using Algebraic Systems

Applied Mathematical Programming Using Algebraic Systems
by

Publisher: Texas A&M University
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.

Home page url

Download or read it online for free here:
Download link
(1.7MB, PDF)

Similar books

Book cover: Iterative Methods for OptimizationIterative Methods for Optimization
by - Society for Industrial Mathematics
This book presents a carefully selected group of methods for unconstrained and bound constrained optimization problems and analyzes them in depth both theoretically and algorithmically. It focuses on clarity in algorithmic description and analysis.
(11082 views)
Book cover: Optimization Algorithms on Matrix ManifoldsOptimization Algorithms on Matrix Manifolds
by - Princeton University Press
Many science and engineering problems can be rephrased as optimization problems on matrix search spaces endowed with a manifold structure. This book shows how to exploit the structure of such problems to develop efficient numerical algorithms.
(18174 views)
Book cover: Optimal Stopping and ApplicationsOptimal Stopping and Applications
by - UCLA
From the table of contents: Stopping Rule Problems; Finite Horizon Problems; The Existence of Optimal Rules; Applications. Markov Models; Monotone Stopping Rule Problems; Maximizing the Rate of Return; Bandit Problems; Solutions to the Exercises.
(13289 views)
Book cover: Linear ProgrammingLinear Programming
by - 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.
(8246 views)