Which of the following is a property of all linear programming problems?

• we can choose from alternate courses of action

• minimization of some objective

• a computer program

• usage of graphs in the solution

• usage of linear and nonlinear equations and inequalities

usage of linear and nonlinear equations and inequalities

• maximum profit point.

• intersection of the profit line and a constraint.

• corner point.

• intersection of two or more constraints.

• None of the above

Tags

CCSS.8.EE.C.8B

The first step in formulating an LP problem is

• graph the problem.

• perform a sensitivity analysis.

• identify the objective and the constraints.

• understand the managerial problem being faced.

• define the decision variables.

In labor planning formulation, how would you write the constraint that there are only 10 full-time tellers (labeled as T) available?

LP theory states that the optimal solution to any problem will lie at

• the origin.

• a corner point of the feasible region.

• the lowest point in the feasible region.

• none of the above

Tags

CCSS.8.EE.C.8B

Consider the following linear programming problem: Maximize Z = 12x + 10y

Subject to: 4x + 3y<=480

2x + 3y<=360

all variables >= 0

Which of the following points (x,y) could be a feasible corner point?

• (40,48)

• (120,0)

• (180,120)

• none of the above

Adding a constraint to a linear programming problem increases the size of the feasible region.

• True

• False

Tags

CCSS.8.EE.C.8B

The following constraint is linear: A*B+2*A ≤ 20

• True

• False

Redundancy causes major difficulties to an LP problem.

• True

• False

Tags

CCSS.HSA.REI.D.12

All linear programs must seek to maximize some quantity.

• True

• False

Tags

CCSS.8.EE.C.8B