Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I have copied the entire problem from the book. It has 7 parts. Please show me how to do any 1-2 of the parts. I mostly understand the problem, but need to see a fully woked out problem.

Given a $m$ x $n$ matrix $A$, $m$-vectors $b$ and $y$, and $n$-vectors $c$ and $x$.
Write the dual $LP$ problems $P$ and $P^d$ in the standard form.

Whether $x$ (respectively, $y$) is a feasible vector for $P$ (respectively, for $P^d$)?
Whether x (respectively, y) is an optimal solution for $P$ (respectively, for $P^d$)?
Whether the complementary slackness conditions hold for $P$ (respectively, for $P^d$)?

Consider the cases a-g listed below and explain your answers in each case.

a.) $ A = \begin{matrix} 1 & 2 \\ 3 & 4 \end{matrix}$, $b^T = (8,18)$, $c^T = (2,1)$, $x^T = (6,0)$, $y^T = (0,2/3)$

b.) $ A = \begin{matrix} 1 & 1 & 2 \\ 2 & 3 & 4 \\ 7 & 6 & 2 \end{matrix}$, $b^T = (2,3,8)$, $c^T = (8,9,4)$, $x^T = (6/9,5/9,0)$, $y^T = (0,5/3,2/3)$

c.) $ A = \begin{matrix} 1 & 1 & 2 \\ 2 & 3 & 4 \\ 6 & 6 & 2 \end{matrix}$, $b^T = (2,3,8)$, $c^T = (8,9,5)$, $x^T = (1,1/3,0)$, $y^T = (1,1,1)$

d.) $ A = \begin{matrix} 3 & 2 \\ 1 & -2 \end{matrix}$, $b^T = (6,1)$, $c^T = (2,1)$, $x^T = (1,2)$, $y^T = (1,1)$

e.) $ A = \begin{matrix} 1 & 1 & 1 & 1 \\ 2 & 1 & -1 & -1 \\ 0 & -1 & 0 & 1 \end{matrix}$, $b^T = (40,-5,10)$, $c^T = (1,-3,1,4)$, $x^T = (35/3,0,55/3,10)$, $y^T = (2,2,0)$

f.) $ A = \begin{matrix} 2 & -6 & 2 & 7 & 3 & 8 \\ -3 & -1 & 4 & -3 & 1 & 2 \\ 8 & -3 & 5& -2 & 0 & 2 \\ 4 & 0 & 8 & 7 & -1 & 3 & \\ 5 & 2 & -3 & 6 & -2 & -1\end{matrix}$, $b^T = (1,-2,4,1,5)$, $c^T = (18,-7,12,5,0,8)$, $x^T = (2,4,0,0,7,0)$, $y^T = (1/3,0,5/3,1,0)$

share|improve this question
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.