Here are five statements. Which answer about the statements is correct?

If an LP problem has an optimal solution, it will be at a corner of the feasible

region.

The feasible side of a linear inequality constraint consists of a line and some

points on both sides of the line.

Linear programming models exhibit linearity among all constraint relationships

and the objective function.

For a feasible LP problem, an equality constraint cannot be binding.

The feasible region usually contains infinite solutions to the linear program.

A$.$ The first and the second statements are false.

B$.$ The second and the fourth statements are false.

C$.$ The second and the third statements are false.

D$.$ The third and the last statements are false.

E$.$ The first and the last statements are false.