Office of Academic Resources
Chulalongkorn University
Chulalongkorn University

Home / Help

AuthorGlashoff, Klaus. author
TitleLinear Optimization and Approximation [electronic resource] : An Introduction to the Theoretical Analysis and Numerical Treatment of Semi-infinite Programs / by Klaus Glashoff, Sven-ร{133}ke Gustafson
ImprintNew York, NY : Springer New York : Imprint: Springer, 1983
Connect tohttp://dx.doi.org/10.1007/978-1-4612-1142-6
Descript 212 p. online resource

SUMMARY

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


CONTENT

I. Introduction and Preliminaries -- II. Weak Duality -- III. Applications of Weak Duality in Uniform Approximation -- IV. Duality Theory -- V. The Simplex Algorithm -- VI. Numerical Realization of The Simplex Algorithm -- VII. A General Three-Phase Algorithm -- VIII. Approximation Problems by Chebyshev Systems -- IX. Examples and Applications of Semi-Infinite Programming -- References


Mathematics System theory Calculus of variations Mathematics Systems Theory Control Calculus of Variations and Optimal Control; Optimization



Location



Office of Academic Resources, Chulalongkorn University, Phayathai Rd. Pathumwan Bangkok 10330 Thailand

Contact Us

Tel. 0-2218-2929,
0-2218-2927 (Library Service)
0-2218-2903 (Administrative Division)
Fax. 0-2215-3617, 0-2218-2907

Social Network

  line

facebook   instragram