A$.$ Multiple choice questions $(3$ pts each$)$

The simplex method is an algorithm that solves:

A$)$ Non$-$linear programming problems

B$)$ Linear programming problems

C$)$ Integer programming problems

D$)$ Dynamic programming problems

A feasible solution that maximizes or minimizes the objective function in a linear programming problem is called:

A$)$ An optimal solution

B$)$ A basic solution

C$)$ An artificial solution

D$)$ A bounded solution

The point where the value of the objective function is at its maximum or minimum and satisfies all constraints is known as:

A$)$ Extreme point

B$)$ Feasible point

C$)$ Optimal point

D$)$ Pivot point

The process of improving the objective function while transitioning from one comer point to another in a feasible region is called:

A$)$ Pivoting

B$)$ Crossing

C$)$ Shifting

D$)$ Transitioning

In optimization, a constraint that does not affect the final solution because it is never 'active' is termed:

A$)$ Redundant constraint

B$)$ Binding constraint