# Describe S = <mo fence="false" stretchy="false">{ ( u , t ) &#x2208;<!-

Describe

using finitely many linear inequalities and equations.
It's easy to show S is convex. We can describe S as
$S=\left\{\left(u,t\right)\in {\mathbb{R}}^{n}×\mathbb{R}:\underset{x\in {\mathbb{R}}^{n},Ax\le b}{sup}{u}^{\prime }x\le t\le \underset{x\in {\mathbb{R}}^{n},Cx\le d}{inf}{u}^{\prime }x\right\}.$
Taking the supremum and infimum over infinitely many expressions is not allowed in the finitely many linear inequalities and equations. The LHS and RHS are solutions to linear programming problems and the hint is to use strong duality, but I couldn't find a way to make the number of conditions finite.
You can still ask an expert for help

• Questions are typically answered in as fast as 30 minutes

Solve your problem for the price of one coffee

• Math expert for every subject
• Pay only if we can solve it

plodno8n
Step 1
This is done with duality. Let me show one inequality:
$\underset{x}{max}\left\{{u}^{T}x:Ax\le b\right\}\le t$
$\underset{y}{min}\left\{{b}^{T}y:{A}^{T}y=u,y\ge 0\right\}\le t$
$\mathrm{\exists }y\ge 0:{b}^{T}y\le t,{A}^{T}y=u$