Question: True or False 1. Given three corner points A, B, and C of a linear programming problem, if A is adjacent to B and B
True or False
1. Given three corner points A, B, and C of a linear programming problem, if A is adjacent to B and B is adjacent to C, then A can be determined from C by interchanging exactly two basic and two nonbasic variables.
2. For a set of primary and dual solutions to be feasible, the objective function value of the primary (Z) can never exceed that of the dual (W) no matter which problem is to maximize and which is to minimize.
3. If the current iteration is degenerate, the next iteration will also be degenerate.
4. The optimal (dual) primary solution can be obtained from the dual (primary) optimal tableau.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
