Feasibility and infeasibility in optimization. Algorithms and computational methods. (Q2473296): Difference between revisions

The most applied optmization problems involve constraints. Therefore the solution returned by an optimization algorithm must also be feasible. Some optimization algorithms are not even able to proceed towards optimality until a feasible solution is available. In addition, the optimization question can be converted to a feasibility question, and vice versa. Therefore the questions of optimization, feasibility and infeasibility are linked. The goal of the book is to summarize the state of the art in recent work at the interface of optimization and feasibility and has the following table of contents: 1. Preliminaries, 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, 6. Isolating infeasibility, 7. Finding the maximum feasible subset of linear constraints, 8. Altering constraints to achieve feasibility, 9. Other model analyses, 10. Data analysis, 11. Miscellaneous applications.