Question 1

The optimal solution for a linear programming problem will always occur

Accepted Answer

A) when the slack price equals the surplus price. 
B) when the surplus price equals the slack price. 
C) at an extreme point. 
D) at a non-extreme point. 
A) when the slack price equals the surplus price. 
B) when the surplus price equals the slack price. 
C) at an extreme point. 
D) at a non-extreme point. C

Question 2

For a less than or equal to (<)constraint the shadow price represents the

Accepted Answer

A) amount you would be willing to pay for one additional unit of a resource. 
B) amount you at which you would be willing to sell one additional unit of a resource. 
C) difference between the slack price and the surplus price. 
D) difference between the surplus price and the slack price. 
A) amount you would be willing to pay for one additional unit of a resource. 
B) amount you at which you would be willing to sell one additional unit of a resource. 
C) difference between the slack price and the surplus price. 
D) difference between the surplus price and the slack price. A

Question 3

A company produces product A and product B.Each product must go through two processes.Each A produced requires two hours in process 1 and five hours in process 2.Each B produced requires six hours in process 1 and three hours in process 2.There are 80 hours of capacity available each week in each process.Each A produced generates $6.00 in profit for the company.Each B produced generates $9.00 in profit for the company.If the company produces 6 units of A and 9 units of B the amount of slack (in hours)for process 1 is

Accepted Answer

A) 0 hours. 
B) 14 hours. 
C) 66 hours. 
D) 80 hours. 
A) 0 hours. 
B) 14 hours. 
C) 66 hours. 
D) 80 hours. A

Question 4

While all linear programming problems have a single objective function,very few,if any,have constraints.

Accepted Answer

A) True 
 B)False

Question 5

Linear programming is a mathematical modeling technique based on linear relationships

Accepted Answer

A) True 
 B)False

Question 6

How is linear programming useful to an operations manager?

Accepted Answer

Linear programming is a mathematical mod

Question 7

What is meant by the term "shadow price" in linear programming?

Accepted Answer

The shadow prices are the marginal value

Question 8

Because linear programming provides an optimal solution,sensitivity analysis is never an important consideration.

Accepted Answer

A) True 
 B)False

Question 9

Briefly define the components that comprise a linear programming model.

Accepted Answer

A linear programming model consists of d

Question 10

The optimal solution for a linear programming problem will always occur at an extreme point.

Accepted Answer

A) True 
 B)False

Question 11

The objective function is a linear relationship that either minimizes or maximizes some value.

Accepted Answer

A) True 
 B)False

Question 12

A company produces product A and product B.Each product must go through two processes.Each A produced requires two hours in process 1 and five hours in process 2.Each B produced requires six hours in process 1 and three hours in process 2.There are 80 hours of capacity available each week in each process.Each A produced generates $6.00 in profit for the company.Each B produced generates $9.00 in profit for the company.If the company produces 6 units of A and 9 units of B the capacity constraint for Process 2 is

Accepted Answer

A) 5A + 3B > 80 B) 6A + 3 B < 80 C) 5A + 3B < 80 D) 5A + 3B < 80. A) 5A + 3B > 80 B) 6A + 3 B < 80 C) 5A + 3B < 80 D) 5A + 3B < 80.

Question 13

The constraint 3x1 + 6x2 > 48 is converted to an equality by

Accepted Answer

A) adding a slack variable. 
B) subtracting a surplus variable. 
C) adding both a slack variable and a surplus variable. 
D) subtracting both a slack variable and a surplus variable. 
A) adding a slack variable. 
B) subtracting a surplus variable. 
C) adding both a slack variable and a surplus variable. 
D) subtracting both a slack variable and a surplus variable.

Question 14

The simplex method is a solution method used for linear programming problems that have

Accepted Answer

A) no constraints. 
B) at least one constraint. 
C) at least two constraints. 
D) at least three constraints. 
A) no constraints. 
B) at least one constraint. 
C) at least two constraints. 
D) at least three constraints.

Question 15

In general,the objective function for linear programming problems in operations is one of minimizing costs.

Accepted Answer

A) True 
 B)False

Question 16

The simplex method used for solving linear programming problems uses matrix algebra to solve simultaneous equations.

Accepted Answer

A) True 
 B)False

Question 17

The area that contains the values that satisfies all the constraints in a linear programming problem is known as the _________________ space.

Accepted Answer

A) optimal solution 
B) non-optimal solution 
C) feasible solution 
D) infeasible solution. 
A) optimal solution 
B) non-optimal solution 
C) feasible solution 
D) infeasible solution.

Question 18

Linear programming problems with two decision variables can be solved graphically.

Accepted Answer

A) True 
 B)False

Question 19

Most real-world linear programming problems are solved graphically.

Accepted Answer

A) True 
 B)False

Question 20

The formulation for a linear programming problem cannot include more than one decision variable.

Accepted Answer

A) True 
 B)False

Exam 14: Operational Decision-Making Tools: Linear Programming

The optimal solution for a linear programming problem will always occur

For a less than or equal to (<)constraint the shadow price represents the

While all linear programming problems have a single objective function,very few,if any,have constraints.

Linear programming is a mathematical modeling technique based on linear relationships

How is linear programming useful to an operations manager?

What is meant by the term "shadow price" in linear programming?

Because linear programming provides an optimal solution,sensitivity analysis is never an important consideration.

Briefly define the components that comprise a linear programming model.

The optimal solution for a linear programming problem will always occur at an extreme point.

The objective function is a linear relationship that either minimizes or maximizes some value.

The constraint 3x1 + 6x2 > 48 is converted to an equality by

The simplex method is a solution method used for linear programming problems that have

In general,the objective function for linear programming problems in operations is one of minimizing costs.

The simplex method used for solving linear programming problems uses matrix algebra to solve simultaneous equations.

The area that contains the values that satisfies all the constraints in a linear programming problem is known as the _________________ space.

Linear programming problems with two decision variables can be solved graphically.

Most real-world linear programming problems are solved graphically.

The formulation for a linear programming problem cannot include more than one decision variable.

Operations Management

Quality Management

Statistical Quality Control

Product Design

Service Design

Processes and Technology

Scheduling

Capacity and Facilities

Human Resources

Project Management

Supply Chain Management: Strategy and Design

Global Supply Chain Procurement and Distribution

Forecasting

Inventory Management

Operational Decision-Making Tools: Simulation

The Sales and Operations Planning Process

Resource Planning

Lean Systems

Operational Decision-Making Tools: Decision Analysis

Operational Decision-Making Tools: Acceptance Sampling

Decision-Making Tools: Facility Location Models

Operational Decision-Making Tools: Work Measurement

Filters

The constraint 3x₁ + 6x₂ > 48 is converted to an equality by