Advertisement

Outer Approximation

  • Reiner Horst
  • Hoang Tuy

Abstract

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).

Keywords

Outer Approximation Supporting Hyperplane Convex Programming Problem Redundant Constraint Independent Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Reiner Horst
    • 1
  • Hoang Tuy
    • 2
  1. 1.Department of MathematicsUniversity of TrierTrierGermany
  2. 2.Institute of MathematicsVien Toan HocHanoiVietnam

Personalised recommendations