Английская Википедия:Algorithmic problems on convex sets
Материал из Онлайн справочника
Many problems in mathematical programming can be formulated as problems on convex sets or convex bodies. Six kinds of problems are particularly important:[1]Шаблон:Rp optimization, violation, validity, separation, membership and emptiness. Each of these problems has a strong (exact) variant, and a weak (approximate) variant.
Strong variants
Weak variants
References