The statement is true, because in a general linear programming problem, if there is a situation of unbounded solution in the primal, then the dual formulated from that problem will definitely produce a result which is infeasible (i.e. a solution that violates at least one of the constraints).
Comments
Leave a comment