Cantitate/Preț
Produs
Total produse
Vezi coșul
Feasibility and Infeasibility in Optimization:: Algorithms and Computational Methods de John W. Chinneck

Feasibility and Infeasibility in Optimization:: Algorithms and Computational Methods: International Series in Operations Research & Management Science, cartea 118

Autor John W. Chinneck
en Limba Engleză Hardback – 6 dec 2007
Feasibility and Infeasibility in Optimization is an expository book focused on practical algorithms related to feasibility and infeasibility in optimization. Part I addresses algorithms for seeking feasibility quickly, including recent algorithms for the difficult cases of nonlinear and mixed-integer programs. Part II provides algorithms for analyzing infeasibility by isolating minimal infeasible (or maximum feasible) subsets of constraints, or by finding the best repair for the infeasibility. Part III describes surprising applications in areas such as classification, computational biology, and medicine. Connections to constraint programming are shown. A main goal is to impart an understanding of the methods so that practitioners can make immediate use of existing algorithms and software, and so that researchers can extend the state of the art and find new applications. The book is of interest to researchers, students, and practitioners across the applied sciences who are working on optimization problems.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 57212 lei  6-8 săpt.
  Springer Us – 23 noi 2010 57212 lei  6-8 săpt.
Hardback (1) 63432 lei  6-8 săpt.
  Springer Us – 6 dec 2007 63432 lei  6-8 săpt.

Din seria International Series in Operations Research & Management Science

Preț: 63432 lei

Preț vechi: 74626 lei
-15% Nou

Puncte Express: 951
Preț estimativ în valută:
12143€ • 12623$ • 10068£

Carte tipărită la comandă

Livrare economică 06-20 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780387749310
ISBN-10: 0387749314
Pagini: 274
Ilustrații: XXII, 274 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.61 kg
Ediția:2008
Editura: Springer Us
Colecția Springer
Seria International Series in Operations Research & Management Science

Locul publicării:New York, NY, United States

Public țintă

Research

Cuprins

Seeking Feasibility.- Preliminaries.- Seeking Feasibility in Linear Programs.- Seeking Feasibility in Mixed-Integer Linear Programs.- A Brief Tour of Constraint Programming.- Seeking Feasibility in Nonlinear Programs.- Analyzing Infeasibility.- Isolating Infeasibility.- Finding the Maximum Feasible Subset of Linear Constraints.- Altering Constraints to Achieve Feasibility.- Applications.- Other Model Analyses.- Data Analysis.- Miscellaneous Applications.- Epilogue.

Recenzii

From the reviews:
"This book is really the first monograph to summarize the growing body of research on the analysis of feasibility and infeasibility of optimization problems. With up to date coverage and very thorough bibliography, it will be of definite interest to researchers working in this area. The book may also be of interest to those readers who are more interested in modeling and applications but want to learn something about techniques for analyzing the feasibility of optimization models." (Brian Borchers, MathDL, March, 2008)

Textul de pe ultima copertă

Constrained optimization models are core tools in business, science, government, and the military with applications including airline scheduling, control of petroleum refining operations, investment decisions, and many others. Constrained optimization models have grown immensely in scale and complexity in recent years as inexpensive computing power has become widely available. Models now frequently have many complicated interacting constraints, giving rise to a host of issues related to feasibility and infeasibility. For example, it is sometimes difficult to find any feasible point at all for a large model, or even to accurately determine if one exists, e.g. for nonlinear models. If the model is feasible, how quickly can a solution be found? If the model is infeasible, how can the cause be isolated and diagnosed? Can a repair to restore feasibility be carried out automatically? Researchers have developed numerous algorithms and computational methods in recent years to address such issues, with a number of surprising spin-off applications in fields such as artificial intelligence and computational biology. Over the same time period, related approaches and techniques relating to feasibility and infeasibility of constrained problems have arisen in the constraint programming community.
Feasibility and Infeasibility in Optimization is a timely expository book that summarizes the state of the art in both classical and recent algorithms related to feasibility and infeasibility in optimization, with a focus on practical methods. All model forms are covered, including linear, nonlinear, and mixed-integer programs. Connections to related work in constraint programming are shown. Part I of the book addresses algorithms for seeking feasibility quickly, including new methods for the difficult cases of nonlinear and mixed-integer programs. Part II provides algorithms for analyzing infeasibility by isolating minimal infeasible (or maximum feasible) subsets of constraints, or by finding the best repair for the infeasibility. Infeasibility analysis algorithms have arisen primarily over the last two decades, and the book covers these in depth and detail. Part III describes applications in numerous areas outside of direct infeasibility analysis such as finding decision trees for data classification, analyzing protein folding, radiation treatment planning, automated test assembly, etc.
A main goal of the book is to impart an understanding of the methods so that practitioners can make immediate use of existing algorithms and software, and so that researchers can extend the state of the art and find new applications. The book is of interest to researchers, students, and practitioners across the applied sciences who are working on optimization problems.

Caracteristici

I am extremely happy with this upcoming book. It is very well-written as well as impressively up-to-date and comprehensive” Fred Hillier, Stanford University (ISOR Series Editor) As originator for many of the developments in the field, Chinneck is in an excellent position to write the authoritative, expository book on the subject and create a website that collects all the ongoing developments. The website will serve as a sales vehicle for the book Chinneck will use and emphasize as much as possible the real world uses and examples of the methods. He can draw from his considerable experience in the area and develop a book that will have value to technically competent practitioners as well as researchers (i.e., linear, nonlinear, integer and computational optimization) who do “live research” on complex problems that require feasibility and infeasibility studies Those folks interested in the book will be drawn from across the Applied and Engineering Sciences. Includes supplementary material: sn.pub/extras