Question

QUESTION 10 This linear programming model has a unique, i.e., only one, optimal solution alternative optimal solutions an unbounded objective function no feasible solution none of the above QUESTION 11 The point (1, 4) satisfies none of the constraints. the first and second constraints but not the third. the first and third constraints but not the second. the second and third constraints but not the first. all three constraints. QUESTION 12 Assigning a value of 20 to the objective function, i.e., making $4X_1 + 20X_2 = 20$ the line for the objective function goes through the following two points (1, 0) and (5, 0) (0, 1) and (0, 5) (1, 0) and (0, 5) (5, 0) and (0, 1) none of the above QUESTION 13 The feasible region of this problem is unbounded. is a straight line segment. contains the origin. all of the above. none of the above.

          QUESTION 10
This linear programming model has
a unique, i.e., only one, optimal solution
alternative optimal solutions
an unbounded objective function
no feasible solution
none of the above
QUESTION 11
The point (1, 4) satisfies
none of the constraints.
the first and second constraints but not the third.
the first and third constraints but not the second.
the second and third constraints but not the first.
all three constraints.
QUESTION 12
Assigning a value of 20 to the objective function, i.e., making $4X_1 + 20X_2 = 20$ the line for the objective function goes through the following two points
(1, 0) and (5, 0)
(0, 1) and (0, 5)
(1, 0) and (0, 5)
(5, 0) and (0, 1)
none of the above
QUESTION 13
The feasible region of this problem
is unbounded.
is a straight line segment.
contains the origin.
all of the above.
none of the above.

QUESTION 10
This linear programming model has
a unique, i.e., only one, optimal solution
alternative optimal solutions
an unbounded objective function
no feasible solution
none of the above
QUESTION 11
The point (1, 4) satisfies
none of the constraints.
the first and second constraints but not the third.
the first and third constraints but not the second.
the second and third constraints but not the first.
all three constraints.
QUESTION 12
Assigning a value of 20 to the objective function, i.e., making 4X1 + 20X2 = 20 the line for the objective function goes through the following two points
(1, 0) and (5, 0)
(0, 1) and (0, 5)
(1, 0) and (0, 5)
(5, 0) and (0, 1)
none of the above
QUESTION 13
The feasible region of this problem
is unbounded.
is a straight line segment.
contains the origin.
all of the above.
none of the above.

Added by Marcus G.

Question

Please give Ace some feedback