Chinneck Feasibility and Infeasibility in Optimization:

Algorithms and Computational Methods
1. Auflage 2007
ISBN: 978-0-387-74932-7
Verlag: Springer US
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, Band 118, 274 Seiten, eBook

Reihe: International Series in Operations Research & Management Science

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.

Zielgruppe

Research

Autoren/Hrsg.

Chinneck, John W.

Inhaltsverzeichnis

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.