The computer algorithm for solving a linear program is called

Dantzig Simplex Method

Dijkstra's Algorithm

Newton's Method

Ford$-$Fulkerson Algorithm

Question $2$

$2$ pts

The set of all possible solutions to a mathematical program is called the

Onull space

feasible region