Question 1

The objective function in a linear programming formulation defines the feasible solution space.

Accepted Answer

A) True 
 B)False  False

Question 2

Atlas Inc. 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 value of the objective function is equal to

Accepted Answer

A)  $36. 
B)  $81. 
C)  $108. 
D)  $117. 
A)  $36. 
B)  $81. 
C)  $108. 
D)  $117. D

Question 3

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. B

Question 4

A formulation for a linear programming model consists of a decision variable, a constraint and several objective functions.

Accepted Answer

A) True 
 B)False

Question 5

Atlas Inc. 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. 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 6

The feasible solution space contains the values for the decision variables that satisfy the linear programming model's constraints.

Accepted Answer

A) True 
 B)False

Question 7

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.

Question 8

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.

Question 9

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

Accepted Answer

A) True 
 B)False

Question 10

Atlas Inc. 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. The company's objective function is

Accepted Answer

A)  Maximize Z = $6.00A + $9.00B. 
B)  Maximize Z = $9.00A + $6.00B. 
C)  Minimize Z = $6.00A + $9.00B. 
D)  Minimize Z = $6.00A +$9.00B. 
A)  Maximize Z = $6.00A + $9.00B. 
B)  Maximize Z = $9.00A + $6.00B. 
C)  Minimize Z = $6.00A + $9.00B. 
D)  Minimize Z = $6.00A +$9.00B.

Question 11

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

Accepted Answer

A) True 
 B)False

Question 12

Atlas Inc. 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. The constraint for process 1 is represented by

Accepted Answer

A)  2A + 5B  80 
C)  2A + 6B < 80. 
D)  2A + 6B < 80 
A)  2A + 5B  80 
C)  2A + 6B < 80. 
D)  2A + 6B < 80

Question 13

_____________ represent a restriction on decision variable values for a linear programming problem.

Accepted Answer

A)  Surpluses 
B)  Constraints 
C)  Extreme points 
D)  Optimal points 
A)  Surpluses 
B)  Constraints 
C)  Extreme points 
D)  Optimal points

Question 14

TicToc produces product A and product B. These products have the following resource requirements.   The firm has a weekly production budget of $3000 and a maximum of 1000 hours of labor per week. Each A produced generates $35.00 in profit for the company. Each B produced generates $25.00 in profit for the company. If the company produces 100 units of A and 200 units of B the amount of slack (in hours) for labor 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.

Question 15

Briefly define the components that comprise a linear programming model.

Accepted Answer

A linear programming model consists of d

Question 16

Atlas Inc. 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.

Question 17

TicToc produces product A and product B. These products have the following resource requirements.   The firm has a weekly production budget of $3000 and a maximum of 1000 hours of labor per week. Each A produced generates $35.00 in profit for the company. Each B produced generates $25.00 in profit for the company. The company's objective function is

Accepted Answer

A)  Maximize Z = $35.00A + $25.00B. 
B)  Minimize Z = $12A + 8B. 
C)  Minimize Z = 4A + 3B. 
D)  None of these answer choices is correct. 
A)  Maximize Z = $35.00A + $25.00B. 
B)  Minimize Z = $12A + 8B. 
C)  Minimize Z = 4A + 3B. 
D)  None of these answer choices is correct.

Question 18

TicToc produces product A and product B. These products have the following resource requirements.   The firm has a weekly production budget of $3000 and a maximum of 1000 hours of labor per week. Each A produced generates $35.00 in profit for the company. Each B produced generates $25.00 in profit for the company. The constraint for the budget is represented by

Accepted Answer

A) $35A + $25B $3,000. C) $12A + $8B > $3,000. D) $12A + $8B < $3,000. A) $35A + $25B $3,000. C) $12A + $8B > $3,000. D) $12A + $8B < $3,000.

Question 19

Most real-world linear programming problems cannot be solved graphically.

Accepted Answer

A) True 
 B)False

Question 20

How is linear programming useful to an operations manager?

Accepted Answer

Linear programming is a mathematical mod

The objective function in a linear programming formulation defines the feasible solution space.

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

A formulation for a linear programming model consists of a decision variable, a constraint and several objective functions.

The feasible solution space contains the values for the decision variables that satisfy the linear programming model's constraints.

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

The optimal solution for a linear programming problem will always occur

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

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

_____________ represent a restriction on decision variable values for a linear programming problem.

Briefly define the components that comprise a linear programming model.

Most real-world linear programming problems cannot be solved graphically.

How is linear programming useful to an operations manager?

Introduction to Operations and Supply Chain Management

Quality Management

Statistical Process Control

Product Design

Service Design

Processes and Technology

Capacity and Facilities Design

Human Resources

Project Management

Supply Chain Management Strategy and Design

Global Supply Chain Procurement and Distribution

Forecasting

Inventory Management

Resource Planning

Lean Systems

Operational Decision-Making Tools: Decision Analysis

Operational Decision-Making Tools: Acceptance Sampling

Operational Decision-Making Tools: Facility Location Models

Operational Decision-Making Tools: Work Measurement

Operational Decison-Making Tools: Transportation and Transshipment Models

Operational Decision-Making Tools: Simulation

Operational Decision-Making Tools: Linear Programming

Filters

Exam 14: Sales and Operations Planning

The objective function in a linear programming formulation defines the feasible solution space.

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

A formulation for a linear programming model consists of a decision variable, a constraint and several objective functions.

The feasible solution space contains the values for the decision variables that satisfy the linear programming model's constraints.

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

The optimal solution for a linear programming problem will always occur

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

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

_____________ represent a restriction on decision variable values for a linear programming problem.

Briefly define the components that comprise a linear programming model.

Most real-world linear programming problems cannot be solved graphically.

How is linear programming useful to an operations manager?

Introduction to Operations and Supply Chain Management

Quality Management

Statistical Process Control

Product Design

Service Design

Processes and Technology

Capacity and Facilities Design

Human Resources

Project Management

Supply Chain Management Strategy and Design

Global Supply Chain Procurement and Distribution

Forecasting

Inventory Management

Resource Planning

Lean Systems

Operational Decision-Making Tools: Decision Analysis

Operational Decision-Making Tools: Acceptance Sampling

Operational Decision-Making Tools: Facility Location Models

Operational Decision-Making Tools: Work Measurement

Operational Decison-Making Tools: Transportation and Transshipment Models

Operational Decision-Making Tools: Simulation

Operational Decision-Making Tools: Linear Programming

Filters