BUS 461 Week 2 Quiz

$7.00
BUS 461 Week 2 Quiz

1.    Question :    The functional constraints of a linear model with nonnegative variables are 3X1 + 5X2 = 16 and 4X1 + X2 = 10. Which of the following points could not be an optimal solution for the model?

Student Answer:          X1 = 2.5, X2 = 0

X1 = 0, X2 = 3.2

X1 = 1, X2 = 2.25

X1 = 2, X2 = 2

Points Received:    1 of 1
Comments:

2.    Question :    A “non-binding” constraint is:

Student Answer:          redundant.

not satisfied with an equality at the optimal solution.

one having zero slack or surplus

never a non-negativity variable constraint.

Points Received:    1 of 1
Comments:

3.    Question :    An over-constrained linear programming problem results in what type of solution?

Student Answer:          Unbounded.

Degenerate.

Infeasible.

Sub-optimal.

Points Received:    1 of 1
Comments:

4.    Question :    A non-binding constraint is always a redundant constraint.

Student Answer:           True
False

Points Received:    1 of 1
Comments:

5.    Question :    Linear programming and integer linear programming both yield a great amount of sensitivity analysis.

Student Answer:           True
False

Points Received:    1 of 1
Comments:

6.    Question :    When specifying linear constraints, the modeler must take into account the unit specification of the decision variables so that the units represented by the left side of the constraints are consistent with the units represented by the right side of the constraints.

Student Answer:            True
False

Points Received:    1 of 1
Comments:

7.    Question :    Linear programming models are a subset of constrained optimization models that require the assumptions of continuity of the variables, certainty of the coefficients, additivity of terms, and proportionality of costs, profits, and the use of resources to the value of the decision variables.

Student Answer:            True
False

Points Received:    1 of 1
Comments:

8.    Question :    The complementary slackness principle states that either there is zero slack on a constraint or the reduced cost is zero.

Student Answer:          True

False

Points Received:    1 of 1
Comments:

9.    Question :    If two extreme points are optimal, then so is every point on the line segment connecting the two extreme points.

Student Answer:            True
False

Points Received:    0 of 1
Comments:

10.    Question :    Minimization linear programming models may not involve constraints.

Student Answer:           True
False

Points Received:    1 of 1
Comments: