The optimal solution of a linear programming problem is always on the border of the feasible region. true() False() b) Every feasible linear programming problem has an optimal solution. true() False() c) A basic feasible point is a feasible point of the problem in standard form. true() False() d) If a PPL has two optimal solutions, then it has infinitely many solutions. true() False()
Indicate which of the following questions is true or false:
a) The optimal solution of a linear programming problem is always on the border of the feasible region. true() False()
b) Every feasible linear programming problem has an optimal solution. true() False()
c) A basic feasible point is a feasible point of the problem in standard form. true() False()
d) If a PPL has two optimal solutions, then it has infinitely many solutions. true() False()
e) In the simplex method, if there are no output variables, this indicates that the problem is not feasible. true() False()
f) With Phase I, it is possible to verify if a feasible region of a PPL is empty or not. true() False()
g) The big-M method allows solving the PPL in two phases. true() False()
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
