Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems / Najlacnejšie knihy
Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems

Kód: 01395897

Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems

Autor Hanif D. Sherali, W.P. Adams

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, schedul ... celý popis

226.33

Bežne: 245.18 €

Ušetríte 18.86 €


Skladom u dodávateľa
Odosielame za 10 - 13 dní
Pridať medzi želanie

Mohlo by sa vám tiež páčiť

Darčekový poukaz: Radosť zaručená
  1. Darujte poukaz v ľubovoľnej hodnote, a my sa postaráme o zvyšok.
  2. Poukaz sa vzťahuje na všetky produkty v našej ponuke.
  3. Elektronický poukaz si vytlačíte z e-mailu a môžete ho ihneď darovať.
  4. Platnosť poukazu je 12 mesiacov od dátumu vystavenia.

Objednať darčekový poukazViac informácií

Viac informácií o knihe Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems

Nákupom získate 547 bodov

Anotácia knihy

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.

Parametre knihy

Zaradenie knihy Knihy po anglicky Mathematics & science Mathematics Probability & statistics

226.33

Obľúbené z iného súdka



Osobný odber Bratislava a 12744 dalších

Copyright ©2008-26 najlacnejsie-knihy.sk Všetky práva vyhradenéSúkromieCookies


Môj účet: Prihlásiť sa
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Nákupný košík ( prázdny )

Vyzdvihnutie v Zásielkovni
zadarmo nad 59,99 €.

Nachádzate sa: