Given an primal optimization with bounded feasible set: $\max \{cx: Ax \leq b\}$.
The feasible region of the dual is $D = \{y:y^\top A = c^\top, y \geq 0\}$.
If the primal feasbile region is a polytope, then the dual might still by an polyhedron (not bounded in all directions).
Each polyhedron can be written as a convex part plus a cone ($V$-representation of polytopes).
How can I get an upper bound $u$ on the values of $y$ in the convex part? (the bound should say that all verticies of $D$ have entries smaller than $u$?)
The bound obviously needs to depend on $c$ and $A$.