Deck 21: Supplement Operational Decision-Making Tools: Linear Programming

Question 1

Graphical solution of a linear programming problem is limited to models with

A)2 constraints
B)only <= constraints
C)2 decision variables
D)decision variables that are positive

Answer 1

C

Question 2

In a linear programming model solution the marginal value is the

A)value of a decision variable
B)value of the objective function
C)value of one additional unit of a constraint resource
D)cost of a constraint resource

Answer 2

C

Question 3

The sensitivity range for a constraint value to the right of the inequality indicates the allowable increase and decrease

A)for the constraint value before the solution becomes infeasible
B)for the constraint value before the decision variables change
C)for the constraint value before the marginal value of the constraint resource is no longer valid
D)for the objective function value

Answer 3

C

Question 4

In a linear programming model the possible decision variable solution values at corner points on the solution space boundary are the result of

A)the simultaneous solution of the objective function and one of the constraints
B)the intersection of the objective function with one of the axes
C)the simultaneous solution of constraints
D)the intersection of one or more of the constraints with one of the axes

Question 5

In order to solve a linear programming model using Excel an add-in is used that is called

A)data
B)data analysis
C)simplex
D)solver

Question 6

In order to transform a constraint <= inequality into an equation

A)a surplus variable is added to the constraint
B)a slack variable is added to the constraint
C)an extra decision variable is added to the constraint
D)the <= sign is changed to an = sign

Question 7

Mathematical symbols that represent levels of activity of an operation in a linear programming model are

A)constraints
B)objective functions
C)slack variables
D)decision variables

Question 8

If a company produces two products,1 and 2,represented by x₁ and x₂ ,and the profit from product 1 is $100 and the profit from product 2 is $50,and the material required to produce one unit of product 1 is 4 lbs.and the labor required to produce one unit of product 2 is 6 lbs.and there are 500 hours of labor available that can be used,the linear programming constraint for material is

A)100x₁ + 50x₂ <= 500
B)4x₁ + 6x₂ = 500
C)4x₁ + 6x₂ >= 500
D)4x₁ + 6x₂ <= 500

Question 9

The traditional mathematical approach for solving a linear programming problem is a mathematical procedure called the

A)variable approach
B)linear equations method
C)simultaneous solution method
D)simplex method

Question 10

It has been proven mathematically that in a linear programming model the optimal solution will always occur

A)anywhere on the solution space boundary
B)at an extreme point protrusion
C)on one of the axes of the solution space
D)where the objective function first touches a corner point on the solution space boundary

Question 11

If a company produces two products,1 and 2,represented by x₁ and x₂ ,and the profit from product 1 is $100 and the profit from product 2 is $50,the objective function for profit,Z,is

A)Z = 50x₁ + 100x₂
B)Z = 150x₁ + 150x₂
C)Z = 100x₁ + 50x₂
D)Z = 100x₁ = 50x₂