Question: For a given scheduling problem, it is proven that there are only three feasible solutions, namely A, B, and C. Their objective function (which is
For a given scheduling problem, it is proven that there are only three feasible solutions, namely A, B, and C. Their objective function (which is of the minimization type) values are 21,20 , and 25 , respectively. Which of the following statements regarding these three solutions is correct? B is optimal. A is optimal. C is the least optimal solution. B is the most optimal solution
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
