If there are two points where an objective function is optimized, what can be said about the linear programming problem? A.
The feasible region has only two vertices.
B.
Two of the constraints are parallel to each other.
C.
The feasible region contains the origin (0, 0).
D.
The objective function is parallel to one of the constraints.

PLEASE HELP.

Long division the problem is 40 ➗ 348 = ?

Girardo is using the model below to solve the equation . girardo uses the following steps: step 1 add 4 negative x-tiles to both sides step 2 add 1 negative unit tile to both sides step 3 the solution is which step could be adjusted so that gerardo's final step results in a positive x-value? in step 1, he should have added 4 positive x-tiles to both sides. in step 1, he should have added 3 negative x-tiles to both sides. in step 2, he should have added 4 negative unit tiles to both sides. in step 2, he should have added 1 positive unit tile to both sides.

Walking at a constant rate of 8 kilometers per hour, juan can cross a bridge in 6 minutes. what is the length of the bridge in meters?