Convex Optimization · Problem 2.8

Convex functions — Boyd & Vandenberghe

Mathematics — Optimization · polyhedra

Problem

Which of the following sets SS are polyhedra? If possible, express SS in the form S={x∣Ax⪯b, Fx=g}S = \{x \mid Ax \preceq b,\, Fx = g\}. ((a)) S={y1a1+y2a2∣−1≤y1≤1, −1≤y2≤1}S = \{y_1 a_1 + y_2 a_2 \mid -1 \leq y_1 \leq 1,\, -1 \leq y_2 \leq 1\}, where a1,a2∈Rna_1, a_2 \in \mathbf{R}^n. ((b)) S={x∈Rn∣x⪰0, 1Tx=1, ∑i=1nxiai=b1, ∑i=1nxiai2=b2}S = \{x \in \mathbf{R}^n \mid x \succeq 0,\, \mathbf{1}^T x = 1,\, \sum_{i=1}^n x_i a_i = b_1,\, \sum_{i=1}^n x_i a_i^2 = b_2\}, where a1,…,an∈Ra_1, \ldots, a_n \in \mathbf{R} and b1,b2∈Rb_1, b_2 \in \mathbf{R}. ((c)) S={x∈Rn∣x⪰0, xTy≤1 for all y with ∥y∥2=1}S = \{x \in \mathbf{R}^n \mid x \succeq 0,\, x^T y \leq 1 \text{ for all } y \text{ with } \|y\|_2 = 1\}. ((d)) S={x∈Rn∣x⪰0, xTy≤1 for all y with ∑i=1n∣yi∣=1}S = \{x \in \mathbf{R}^n \mid x \succeq 0,\, x^T y \leq 1 \text{ for all } y \text{ with } \sum_{i=1}^n |y_i| = 1\}.

Browse the problem library