Linear optimization approximation introduction par glashoff gustafson (3 résultats)
- Couverture souple
- Édition originale
Vendeur : Antiquariat Deinbacher, Murstetten, AutricheAntiquariat Deinbacher
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Occasion
EUR 27,50
EUR 42,00 expéditionExpédition depuis Autriche vers Etats-UnisQuantité disponible : 1 disponible(s)
8° , Softcover/Paperback. 1.Auflage.. ix, 197 Seiten Einband etwas berieben, Bibl.Ex., innen guter und sauberer Zustand 9783540908579 Sprache: Englisch Gewicht in Gramm: 2979.
- Couverture souple
Vendeur : Ria Christie Collections, Uxbridge, Royaume-UniRia Christie Collections
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 60,66
EUR 13,89 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New. In.
- Couverture souple
Vendeur : Buchpark, Trebbin, AllemagneBuchpark
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Occasion - Très bon
EUR 39,60
EUR 105,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Etat : Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | 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 mathemat…ical 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.
