Linear Optimization and Approximation: An Introduction to the Theoretical Analysis and Numerical Treatment of Semi-infinite Programs

Author:   K. Glashoff ,  S.-A. Gustafson
Publisher:   Springer-Verlag New York Inc.
Edition:   Softcover reprint of the original 1st ed. 1983
Volume:   45
ISBN:  

9780387908571


Pages:   212
Publication Date:   13 April 1983
Format:   Paperback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $211.07 Quantity:  
Add to Cart

Share |

Linear Optimization and Approximation: An Introduction to the Theoretical Analysis and Numerical Treatment of Semi-infinite Programs


Add your own review!

Overview

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.

Full Product Details

Author:   K. Glashoff ,  S.-A. Gustafson
Publisher:   Springer-Verlag New York Inc.
Imprint:   Springer-Verlag New York Inc.
Edition:   Softcover reprint of the original 1st ed. 1983
Volume:   45
Dimensions:   Width: 15.50cm , Height: 1.10cm , Length: 23.50cm
Weight:   0.670kg
ISBN:  

9780387908571


ISBN 10:   0387908579
Pages:   212
Publication Date:   13 April 1983
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

Aorrng

Shopping Cart
Your cart is empty
Shopping cart
Mailing List