Write Down (Without Solving) the Dual LP Problem $c = s + 6 t + u$

Essay

Write down (without solving) the dual LP problem.
​
Minimize $c = s + 6 t + u$ subject to
​ $\begin{array} { l } 2 s - t + v \geq 1,000 \\u - v \geq 2,000 \\s + t \geq 1,500 \\s \geq 0 , t \geq 0 , u \geq 0 , v \geq 0\end{array}$ ​
Use the letters x, y, z, and w in the indicated order. Please, use the numbers in the expression for ​p in order they come in the given LP problem.
​
Maximize $p =$ __________ subject to the constraints.
​
Please enter the inequalities, separated with commas.