1 Consider the following linear programming problem and its dual: minimize,c^(T)x maximize b^(T)y subject to Ax=b subject to A^(T)y =0., and assume that both problems

1 Consider the following linear programming problem and its dual: minimize,c^(T)x maximize b^(T)y subject to Ax=b subject to A^(T)y<=c. ,x>=0., and assume that both problems have an optimal sol