Feasibility and infeasibility in optimization : algorithms and computational methods / John W. Chinneck.

Includes bibliographical references (pages [249]-263) and index.

-- 1. Preliminaries -- Pt. I. Seeking feasibility -- 2. Seeking feasibility in linear programs -- 3. Seeking feasibility in mixed-integer linear programs -- 4. A brief tour of constraint programming -- 5. Seeking feasibility in nonlinear programs -- Pt. II. Analyzing infeasibility -- 6. Isolating infeasibility -- 7. Finding the maximum feasible subset of linear constraints -- 8. Altering constraints to achieve feasibility -- Pt. III. Applications -- 9. Other model analyses -- 10. Data analysis -- 11. Miscellaneous applications -- 12. Epilogue.

"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." "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."--Jacket.