Question 1

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

Accepted Answer

A) True 
 B)False

Question 2

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 capacity constraint for labor is

Accepted Answer

A)  12A + 8B > 1000. 
B)  12A + 8B  1000. 
A)  12A + 8B > 1000. 
B)  12A + 8B  1000.

Question 3

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

Accepted Answer

A) True 
 B)False

Question 4

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

Accepted Answer

A)  $2,800. 
B)  $8,500. 
C)  $9,500. 
D)  $11,800. 
A)  $2,800. 
B)  $8,500. 
C)  $9,500. 
D)  $11,800.

Question 5

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

Accepted Answer

The shadow prices are the marginal value

Question 6

Operations mangers find very few types of linear program models applicable today because finding an optimal solution is no longer a concern.

Accepted Answer

A) True 
 B)False

Question 7

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

Accepted Answer

A) True 
 B)False

Question 8

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

Accepted Answer

A) True 
 B)False

Question 9

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

Accepted Answer

A) True 
 B)False

Question 10

A linear programming model's constraints are nonlinear relationships that describe the restrictions placed on the decision variables.

Accepted Answer

A) True 
 B)False

Question 11

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 12

Linear programming is a mathematical modeling technique based on linear relationships

Accepted Answer

A) True 
 B)False

Question 13

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 14

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

Accepted Answer

A) True 
 B)False

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

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

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

Operations mangers find very few types of linear program models applicable today because finding an optimal solution is no longer a concern.

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

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

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

A linear programming model's constraints are nonlinear relationships that describe the restrictions placed on the decision variables.

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

Linear programming is a mathematical modeling technique based on linear relationships

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 three decision variables can be solved graphically.

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 optimal solution for a linear programming problem will always occur at an extreme point.

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

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

Operations mangers find very few types of linear program models applicable today because finding an optimal solution is no longer a concern.

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

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

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

A linear programming model's constraints are nonlinear relationships that describe the restrictions placed on the decision variables.

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

Linear programming is a mathematical modeling technique based on linear relationships

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 three decision variables can be solved graphically.

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