DIFFERENTIAL EQUATIONS

True or False. Explain why or provide a counter-example. a. Inthe simplex algorithm, a variable that has just left the basis cannot reenter in the very next iteration. b. Inthe simplex algorithm, a variable that has just entered the basis cannot leave in the very next iteration. c. Ifwe have a constraint in standard maximum form, and we multiply both the right- hand side of each constraint by k and multiply the constants in the objective function by k, the optimal solution is also multiplied by k. It is possible to construct a linear program in which every feasible point is optimal A degenerate LP always has multiple solutions that provide the same optimal value