Ships from/sold by Buy.com
See All Buying Options
advertisement
Earn Rakuten Super Points™: Write a Review
Sorry, this selection is currently unavailable.
Linear Optimization and Approximation: An Introduction to the Theoretical Analysis and Numerical Treatment of Semi-Infinite Programs Glashoff, Klaus |Glashoff, K. |Gustafson, S. -A  1 of 1
$109.00
$107.80  + Free Shipping
EARN 108 RAKUTEN SUPER POINTS™ Rakuten Super Points™
What are Rakuten Super Points™?
Get rewarded when you shop! Earn 1 point per dollar spent. That's like getting cash back on every purchase. Easy to see matured points in checkout. Use points just like cash.
Learn More
FORMAT: Paperback
CONDITION:  Brand New
IN STOCK: Usually Ships within 24 hours
2 New
from
$74.00
See all sellers
45 day return policy
Share
promo
 
Description
More Buying Options
 

Learn more about Linear Optimization and Approximation: An Introduction to the Theoretical Analysis and Numerical Treatment of Semi-Infinite Programs:

Format: Paperback
ISBN-10: 0387908579
ISBN-13: 9780387908571
Sku: 210457015
Publish Date: 11/25/2008
Pages:  212
Age Range:  NA
 
From the Publisher:
A linear optimization problem is the task of minimizing a linear real-valued function of finitely many variables subject to linear con­ straints; in general there may be infinitely many constraints. This book is devoted to such problems. Their mathematical properties are investi­ gated and algorithms for their computational solution are presented. Applications are discussed in detail. Linear optimization problems are encountered in many areas of appli­ cations. They have therefore been subject to mathematical analysis for a long time. We mention here only two classical topics from this area: the so-called uniform approximation of functions which was used as a mathematical tool by Chebyshev in 1853 when he set out to design a crane, and the theory of systems of linear inequalities which has already been studied by Fourier in 1823. We will not treat the historical development of the theory of linear optimization in detail. However, we point out that the decisive break­ through occurred in the middle of this century. It was urged on by the need to solve complicated decision problems where the optimal deployment of military and civilian resources had to be determined. The availability of electronic computers also played an important role. The principal computational scheme for the solution of linear optimization problems, the simplex algorithm, was established by Dantzig about 1950. In addi­ tion, the fundamental theorems on such problems were rapidly developed, based on earlier published results on the properties of systems of linear inequalities.

Product Attributes

Product attributeBook Format:   Paperback
Product attributeNumber of Pages:   0212
Product attributePublisher:   Springer
Product attributeSeries Part:   45
Advertisement Bottom