9780792342014 - interior point methods in mathematical programming: 5 (14 risultati)
- Rilegato
Da: Anybook.com, Lincoln, Regno UnitoAnybook.com
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Buono
EUR 89,40
EUR 36,34 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Condizione: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,1200grams, ISBN:9780792342014.
- Rilegato
Da: Librairie Parrêsia, Figeac, , FranciaLibrairie Parrêsia
Contatta il venditoreVenditore con 4 stelleCondizione: Usato - Molto buono
EUR 120,00
EUR 32,50 spedizioneSpedito da Francia a U.S.A.Quantità: 1 disponibili
Hardcover Sep 30, 1996. Condizione: Used: Very Good. Interior Point Methods in Mathematical Programming | T. Terlaky | Kluwer Academic, 1996, in-8 cartonnage éditeur, 528 pages. Couverture très légèrement passée. Dos solide. Intérieur frais. Exemplaire de bibliothèque : petit code barre en pied de 1re de couv., cotation au dos,…rares et discrets petits tampons à l'intérieur de l'ouvrage. Bon exemplaire. [BT35+].
- Rilegato
Da: Librairie Parrêsia, Figeac, , FranciaLibrairie Parrêsia
Contatta il venditoreVenditore con 4 stelleCondizione: Usato - Molto buono
EUR 120,00
EUR 32,50 spedizioneSpedito da Francia a U.S.A.Quantità: 1 disponibili
Hardcover Sep 30, 1996. Condizione: Used: Very Good. Interior Point Methods in Mathematical Programming | T. Terlaky | Kluwer Academic, 1996, in-8 cartonnage éditeur, 528 pages. Couverture très légèrement passée. Dos solide. Intérieur frais. Exemplaire de bibliothèque : petit code barre en pied de 1re de couv., cotation au dos,…rares et discrets petits tampons à l'intérieur de l'ouvrage. Bon exemplaire. [BT35+].
- Rilegato
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 310,79
EUR 13,86 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
- Rilegato
Da: moluna, Greven, , Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 267,86
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Gebunden. Condizione: New.
- Rilegato
Da: Buchpark, Trebbin, , GermaniaBuchpark
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Molto buono
EUR 215,65
EUR 105,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Condizione: Gut. Zustand: Gut | Seiten: 556 | Sprache: Englisch | Produktart: Bücher | 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 pro…vide 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).
- Rilegato
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 332,62
EUR 2,28 spedizioneSpedito in U.S.A.Quantità: 15 disponibili
Condizione: New.
- Rilegato
Da: Buchpark, Trebbin, , GermaniaBuchpark
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Ottimo
EUR 222,12
EUR 105,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Condizione: Sehr gut. Zustand: Sehr gut | Seiten: 556 | Sprache: Englisch | Produktart: Bücher | 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).
- Rilegato
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 359,77
EUR 2,28 spedizioneSpedito in U.S.A.Quantità: 15 disponibili
Condizione: As New. Unread book in perfect condition.
- Rilegato
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandaKennys Bookshop and Art Galleries Ltd.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 383,59
EUR 10,50 spedizioneSpedito da Irlanda a U.S.A.Quantità: 15 disponibili
Condizione: 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, managemen…t 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. . . . .
- Rilegato
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 333,77
EUR 64,96 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Buch. Condizione: 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 intr…oduction 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).
- Rilegato
Da: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 480,78
EUR 9,06 spedizioneSpedito in U.S.A.Quantità: 15 disponibili
Condizione: 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, managemen…t 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. . . . . Books ship from the US and Ireland.
- Rilegato
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 320,99
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. 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 pro…vide 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).Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 556 pp. Englisch.
- Rilegato
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, , GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 362,73
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Buch. Condizione: 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.
