Which of the following statements is false? a. A feasible solution satisfies all constraints.
b. In a linear programming problem, the objective function and the constraints must be linear functions of the decision variables.
c. It is possible to have exactly two optimal solutions to a linear programming problem.
d. An optimal solution to a linear programming problem can be found at an extreme point of the feasible region for the problem.

d. An optimal solution to linear programming problem can be found at an extreme point of the feasible region for the problem.

Step-by-step explanation:

A feasible solution satisfies all the constraints of the problem in linear programming. The constraints are the restrictions on decision variable. They limit the value of decision variable in linear programming. Optimal solutions occur when there is feasible problem in the programming.

he used the algebra tiles correctly.

step-by-step explanation:

given : 3x(2x-1)

solution :

since he used algebra tiles .

armando's solution is the same in the solution shown in figure

as he distributed 2x into x and x and wrote them vertically

and also write   -1 vertically

and 3x into x and x and x and wrote it horizontally

performing the multiplication in the algebra tiles we get

and solving the given expression :

3x(2x-1)

since solving the expression using tiles   and solving the expression algebraically we get the same answer

thus   we can choose the first statement as the answer to this problem which is "he used the algebra tiles correctly".

step-by-step explanation:

compare