Please respond to the following 4 open-ended prompts by demonstrating the fullest extent of your knowledge. hear circumstances can you relax one or more of these assumptions? b) What are some similarities and differences between transportation and assignment problems’? (c) Briefly describe the difference between an exact algorithm and a heuristic. When are heuristics needed? d) What situations in linear programming would it be beneficial to use the duality theory of the Simplex method?
Assumption of classic linear programming