LP_Basics

Linear programming problems may have multiple goals or objectives specified.

• true

• false

Linear programming problems always involve either maximizing or minimizing an objective function.

• true

• false

Constraints limit the alternatives available to a decision maker.

• true

• false

Tags

CCSS.8.EE.C.8B

The equation 3xy=9 is linear.

• true

• false

Tags

CCSS.8.F.A.3

All constraints in a linear programming problem are either ≤ or ≥ inequalities.

• true

• false

Tags

CCSS.8.EE.C.8B

Linear programming models can have either ≤ or ≥ inequality constraints but not both in the same problem.

• true

• false

Tags

CCSS.8.EE.C.8B

The continuous-variables assumption states that the decision variables in a linear programming problem can take on any value within the range permitted by the constraints.

• true

• false

Tags

CCSS.8.EE.C.8B

A manager should know the following things about linear programming. What it is. When it should be used. When it should not be used. How to interpret the results of a study. All of the answer choices are correct.

• What it is.

• When it should be used.

• When it should not be used.

• How to interpret the results of a study.

• All of the answer choices are correct.

Which of the following is not a component of a linear programming model?

• constraints

• decision variables

• parameters

• an objective

• a spreadsheet

Which of the following could not be a constraint for a linear programming problem?

• 1A + 2B ≤ 3

• 1A + 2B ≥ 3

• 1A + 2B = 3

• 1A + 2B

• 1A + 2B 1A + 2B + 3C ≤ 3