Algorithms and computational methods in feasibility and infeasibility

摘要

Feasibility and infeasibility is a subject of fundamental and enduring interest in optimization and in the closely related field of constraint satisfaction. It is often sufficient to simply determine whether or not a solution exists; in other cases, an optimization algorithm requires that a feasible result be found before the method can proceed to the optimum. Indeed, feasibility and optimality are closely linked. For example, any optimality problem can be converted to a feasibility problem just by converting the objective function to a constraint and requiring that this constraint achieve a suitable aspiration level.