Outer approximation of the feasible set by a sequence of simpler relaxed sets is a basic method in many fields of optimization. In this technique, the current approximating set is improved by a suitable additional constraint (a cut).
KeywordsOuter Approximation Supporting Hyperplane Convex Programming Problem Redundant Constraint Independent Constraint
Unable to display preview. Download preview PDF.