Над 4 милиона заглавия на английски и други езици! Открийте новата си история още днес! Безплатна доставка за поръчки над 69.99€

Проверка на състоянието на поръчката

Станете част от общност от любители на книгите от цял свят и получавате много предимства. Създай на безплатен акаунт

Безплатна доставка със Еконт над 69.99 €

Куриер Speedy 3.49 € Пункт на Speedy 3.49 € ЕКОНТ 3.99 € Еконтомат/Офис на Еконт 3.99 € Ekont Box 3.99 € Sameday 3.99 € Sameday box 3.99 € Box Now 3.99 €

Контакт

Как се пазарува?

Помощ

Моят акаунт

▸ Празна :-(

Книги на английски > Mathematics & Science > Mathematics > Calculus & mathematical analysis > Numerical analysis > Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems

Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems

Name: Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems
Brand: Springer-Verlag New York Inc.
SKU: 01423236
Price: 238.83 EUR
Availability: InStock
Author: Hanif D. Sherali
ISBN: 9781441948083

Hanif D. Sherali

W. P. Adams

Език

Английски език

Книга С меки корици

Код Либристо: 01423236

Издателство Springer-Verlag New York Inc., декември 2010

This book addresses a new method for generating tight linear or convex programming relaxations for d... Цялото описание

Код Либристо: 01423236

577 b

238.83 €

467.11 лв

Външен склад Изпращаме след 5-8 дни

30 дни за връщане на стоката

Клиентите са закупили също

Le guide de la Gentlewoman Vanessa Seward

С меки корици

28.84 € 56.40 лв

Zakładka Academia Świat 15208 IF

binding.

3.52 € 6.88 лв

Astrein war es nur selten Marcus Clary und Aldringen

С меки корици

21.28 € 41.62 лв

Histoire Ancienne Jusqu'a Cesar Tome 2 Y. Otaka

С меки корици

48.10 € 94.08 лв

Heilbehandlungen fur Dich und Dein geliebtes Tier Antonia Katharina Tessnow

С меки корици

19.05 € 37.26 лв

ERRESKATATZAILE MAGIKOAK 2. ETA ALDERANTZIZKO URTEBETETZEA CATDOOR

С меки корици

14.49 € 28.35 лв

Histoire De France Depuis 1799 Jusqu'en 1812, Volume 1 Louis-Pierre-Edouard Bignon

С меки корици

27.91 € 54.58 лв

POSTERS Ricardo Liniers

С меки корици

24.59 € 48.10 лв

Hygiene de la Ville de Lyon, Ou Opinions Et Rapports de l'Ancien Conseil de Salubrite Du Rhone ""

С меки корици

17.45 € 34.12 лв

Le Tresor de la Cuisiniere Et de la Maitresse de Maison. (Ed.1852) Sans Auteur

С меки корици

20.29 € 39.69 лв

Extramundana Carl Spitteler

С меки корици

33.09 € 64.71 лв

Compendium Der Metallurgischen Chemie Carl A. M. Balling

С меки корици

37.80 € 73.93 лв

Hotel im Lustgarten von Potsdam Jörg Fröhlich

С меки корици

8.23 € 16.09 лв

Reader Gruppendynamik Anita Zimmermann

С меки корици

9.47 € 18.52 лв

Rezeptionserweiterungen klassischer TV-Formate im Internet Erik Hilse

С меки корици

18.12 € 35.44 лв

Das Vaterunser Neil Douglas-Klotz

С меки корици

14.39 € 28.15 лв

Was Jones erzählt Catherine Rey

С твърди корици

21.80 € 42.63 лв

QuarkXPress 6 pro Windows a Macintosh Elaine Weinmann

С меки корици

13.41 € 26.22 лв

This book addresses a new method for generating tight linear or convex programming relaxations for discrete and continuous nonconvex programming problems. Problems of this type arise in many economics, location-allocation, scheduling and routing, and process control and engineering design applications. The principal thrust is to commence with a model that affords a useful representation and structure, and then to further strengthen this representation through an automatic reformulation and constraint generation technique. The contents of this book comprise the original work of the authors compiled from several journal publications, and not covered in any other book on this subject. The outstanding feature of this book is that it offers for the first time a unified treatment of discrete and continuous nonconvex programming problems. In essence, the bridge between these two types of nonconvexities is made via a polynomial representation of discrete constraints. The book lays the foundation of an idea that is stimulating and that has served to enhance the solubility of many challenging problems in the field. Audience: This book is intended for researchers and practitioners who work in the area of discrete or continuous nonlinear, nonconvex optimization problems, as well as for students who are interested in learning about techniques for solving such problems.