If a feasible solution to a linear programming is known, and the corresponding value of the objective function is close to the optimum, can we get a feasible solution to the dual programming which also reaches a value close to the optimal value, or only the value of objective function, but no solution? Thanks.
how to get a feasible solution to dual program from a feasible solution to primal program?
wander
- 11
- 1
- 2