0
Your cart

Your cart is empty

Books > Reference & Interdisciplinary > Communication studies > Information theory > Cybernetics & systems theory

Buy Now

Linear Optimization and Approximation - An Introduction to the Theoretical Analysis and Numerical Treatment of Semi-infinite Programs (Paperback, Softcover reprint of the original 1st ed. 1983) Loot Price: R1,603
Discovery Miles 16 030
Linear Optimization and Approximation - An Introduction to the Theoretical Analysis and Numerical Treatment of Semi-infinite...

Linear Optimization and Approximation - An Introduction to the Theoretical Analysis and Numerical Treatment of Semi-infinite Programs (Paperback, Softcover reprint of the original 1st ed. 1983)

K. Glashoff, S. -A Gustafson

Series: Applied Mathematical Sciences, 45

 (sign in to rate)
Loot Price R1,603 Discovery Miles 16 030 | Repayment Terms: R150 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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."

General

Imprint: Springer-Verlag New York
Country of origin: United States
Series: Applied Mathematical Sciences, 45
Release date: April 1983
First published: May 1983
Authors: K. Glashoff • S. -A Gustafson
Dimensions: 235 x 155 x 11mm (L x W x T)
Format: Paperback
Pages: 212
Edition: Softcover reprint of the original 1st ed. 1983
ISBN-13: 978-0-387-90857-1
Categories: Books > Reference & Interdisciplinary > Communication studies > Information theory > Cybernetics & systems theory
Books > Science & Mathematics > Mathematics > Calculus & mathematical analysis > Calculus of variations
LSN: 0-387-90857-9
Barcode: 9780387908571

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners