glashoff k (23 resultados)

Broschiert. Condición: Gut. 197 Seiten Das hier angebotene Buch stammt aus einer teilaufgelösten Bibliothek und kann die entsprechenden Kennzeichnungen aufweisen (Rückenschild, Instituts-Stempel.); der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 320.

(=Bechtle Anekdoten, Bd.22), 72 S. m. 24 Zeichnungen v. A.Hermsen, ill. OPp. Weihnachtsgabe des Teehauses Schrader.

Condición: As New. Unread book in perfect condition.

Condición: New. pp. 212.

Condición: New. pp. 212 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Softcover. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. C-01537 3540108718 Sprache: Englisch Gewicht in Gramm: 1050.

Condición: New. pp. 212.

Condición: New. In.

PF. Condición: New.

207 S., Die Abhandlungen in diesem Band sind teilweise in englischer, teilweise in deutscher Sprache verfaßt. 3764310995 Sprache: Englisch Gewicht in Gramm: 540 Groß 8°, Original-Pappband, Einband in Klarsichtfolie eingeschlagen, Name auf Innendeckel, sauberes Exemplar (hard cover, with an owners name,# clean copy),

Condición: New.

Condición: New.

440 S., 3540108718 Sprache: Englisch Gewicht in Gramm: 700 Groß 8°, Original-Karton (Softcover), Bibliotheks-Exemplar (ordnungsgemäß entwidmet), Stempel auf Titel, insgesamt gutes und innen sauberes Exemplar,

Condición: As New. Unread book in perfect condition.

Condición: New. In.

Paperback. Condición: New.

Condición: New.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Condición: Sehr gut. Zustand: Sehr gut | Seiten: 442 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Condición: 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 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.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 212 pp. Englisch.

Kartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A survey of homotopy methods for smooth mappings.- Discrete correction methods for operator equations.- A duffing equation with more than 20 branch points.- Einschliessungssaetze fuer Fixpunkte.- A numerically stable update for simplicial algorithms.- Numeric.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 212 pp. Englisch.