Zu dieser ISBN ist aktuell kein Angebot verfügbar.
Alle Exemplare der Ausgabe mit dieser ISBN anzeigen:Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Versand:
EUR 2,43
Innerhalb der USA
Buchbeschreibung Zustand: New. Bestandsnummer des Verkäufers 755464-n
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Hardcover. Zustand: new. Bestandsnummer des Verkäufers 9780792342014
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Gebunden. Zustand: New. Bestandsnummer des Verkäufers 5967877
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Zustand: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Bestandsnummer des Verkäufers ria9780792342014_lsuk
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Zustand: New. Bestandsnummer des Verkäufers 755464-n
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Zustand: New. Bestandsnummer des Verkäufers ABLIING23Feb2416190182272
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - One has to make everything as simple as possible but, never more simple. Albert Einstein Discovery consists of seeing what every body has seen and thinking what nobody has thought. Albert S. ent_Gyorgy; The primary goal of this book is to provide an introduction to the theory of Interior Point Methods (IPMs) in Mathematical Programming. At the same time, we try to present a quick overview of the impact of extensions of IPMs on smooth nonlinear optimization and to demonstrate the potential of IPMs for solving difficult practical problems. The Simplex Method has dominated the theory and practice of mathematical pro gramming since 1947 when Dantzig discovered it. In the fifties and sixties several attempts were made to develop alternative solution methods. At that time the prin cipal base of interior point methods was also developed, for example in the work of Frisch (1955), Caroll (1961), Huard (1967), Fiacco and McCormick (1968) and Dikin (1967). In 1972 Klee and Minty made explicit that in the worst case some variants of the simplex method may require an exponential amount of work to solve Linear Programming (LP) problems. This was at the time when complexity theory became a topic of great interest. People started to classify mathematical programming prob lems as efficiently (in polynomial time) solvable and as difficult (NP-hard) problems. For a while it remained open whether LP was solvable in polynomial time or not. The break-through resolution ofthis problem was obtained by Khachijan (1989). Bestandsnummer des Verkäufers 9780792342014
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Buch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -One has to make everything as simple as possible but, never more simple. Albert Einstein Discovery consists of seeing what every body has seen and thinking what nobody has thought. Albert S. ent_Gyorgy; The primary goal of this book is to provide an introduction to the theory of Interior Point Methods (IPMs) in Mathematical Programming. At the same time, we try to present a quick overview of the impact of extensions of IPMs on smooth nonlinear optimization and to demonstrate the potential of IPMs for solving difficult practical problems. The Simplex Method has dominated the theory and practice of mathematical pro gramming since 1947 when Dantzig discovered it. In the fifties and sixties several attempts were made to develop alternative solution methods. At that time the prin cipal base of interior point methods was also developed, for example in the work of Frisch (1955), Caroll (1961), Huard (1967), Fiacco and McCormick (1968) and Dikin (1967). In 1972 Klee and Minty made explicit that in the worst case some variants of the simplex method may require an exponential amount of work to solve Linear Programming (LP) problems. This was at the time when complexity theory became a topic of great interest. People started to classify mathematical programming prob lems as efficiently (in polynomial time) solvable and as difficult (NP-hard) problems. For a while it remained open whether LP was solvable in polynomial time or not. The break-through resolution ofthis problem was obtained by Khachijan (1989). 556 pp. Englisch. Bestandsnummer des Verkäufers 9780792342014
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Zustand: New. Offers an overview of the research in interior point methods. This book gives an overview of basic variants of interior point algorithms for linear programming. It also deals with nonlinear programming. It is useful for researchers and graduate students in mathematical programming, operations research, management science, and combinatorics. Editor(s): Terlaky, Tamas. Series: Applied Optimization. Num Pages: 552 pages, biography. BIC Classification: PBT; PBW; UM. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 30. Weight in Grams: 951. . 1996. Hardback. . . . . Bestandsnummer des Verkäufers V9780792342014
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Zustand: New. pp. 556. Bestandsnummer des Verkäufers 26549561
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren