Problem 5 (20 points) Label each of the following statements about LP as TRUE or

Question

Problem 5 (20 points) Label each of the following statements about LP as TRUE or FALSE I TRUE FALSE For minimization problems, if the objective function evaluated at II TRUE FALSE Only CFP (corner point feasible solution) can be optimal for a TRUE FALSE If there is no leaving basic variable at some iterations of simplex IV TRUE FALSE In a particular iteration of the simplex method, if there is a tie for Please circle your answer. current CFP (corner point feasible solution) is no larger than its value at every adjacent CFP solution, then this solution is optimal. linear program, so the number of optimal solutions cannot exceed the number of CFP in the feasible region. method, then the problem has no feasible solution. which variable should be the leaving basic variable, the tie can be break arbitrarily

Explanation / Answer

I. The statement is True. In Minimisation Problem, if the value of objective function evaluated at current CFP is less than its adjacent CFP. Then, the solution is optimal.

II.The statement is True.The number of optimal solutions cannot exceed the number of CFP in the feasible region.

III. The statement is True. There has to be a leaving variable and entering variable in order to get Feasible Solution.

IV.The statement is True. Tie can be selected arbitarily.

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---