Question 1

________ is the amount by which the left-hand side falls short of the right-hand side in a linear programming model.

Accepted Answer

The answer of ________ is the amount by which the...

Question 2

The objective function Maximize Z = 3x2 = 4y is appropriate.

Accepted Answer

A) True 
 B)False

Question 3

What are the assumptions of linear programming? Provide examples of each.

Accepted Answer

The assumptions are certainty,linearity,

Question 4

If merely rounding up or rounding down a result for a decision variable is not sufficient when they must be expressed in whole units,then a decision maker might instead use ________ to analyze the situation.

Accepted Answer

The answer of If merely rounding up or rounding down...

Question 5

In linear programming,each parameter is assumed to be known with certainty.

Accepted Answer

A) True 
 B)False

Question 6

________ is useful for allocating scarce resources among competing demands.

Accepted Answer

The answer of ________ is useful for allocating scarce resources...

Question 7

A binding constraint is the amount by which the left-hand side falls short of the right-hand side.

Accepted Answer

A) True 
 B)False

Question 8

What is the meaning of a slack or surplus variable?

Accepted Answer

The amount by which the left-h

Question 9

A site manager has three day laborers available for eight hours each and a burning desire to maximize his return on their wages.The site manager uses linear programming to assign them to two tasks and notes that he has enough work to occupy 21 labor hours.The linear program that the site manager has constructed has

Accepted Answer

A) slack. 
B) surplus. 
C) a positive shadow price for labor. 
D) no feasible solution. 
A) slack. 
B) surplus. 
C) a positive shadow price for labor. 
D) no feasible solution.

Question 10

A constraint is a limitation that restricts the permissible choices.

Accepted Answer

A) True 
 B)False

Question 11

The interval over which the right-hand-side parameter can vary while its shadow price remains valid is the ________.

Accepted Answer

range of f

Question 12

A manager is interested in deciding production quantities for products A,B,and C.He has an inventory of 20 tons each of raw materials 1,2,3,and 4 that are used in the production of products A,B,and C.He can further assume that he can sell all of what he makes.Which of the following statements is correct?

Accepted Answer

A) The manager has four decision variables. 
B) The manager has three constraints. 
C) The manager has three decision variables. 
D) The manager can solve this problem graphically. 
A) The manager has four decision variables. 
B) The manager has three constraints. 
C) The manager has three decision variables. 
D) The manager can solve this problem graphically.

Question 13

The graphical method is a practical method for solving product mix problems of any size,provided the decision maker has sufficient quantities of graph paper.

Accepted Answer

A) True 
 B)False

Question 14

The assumption of ________ allows a decision maker to combine the profit from one product with the profit from another to realize the total profit from a feasible solution.

Accepted Answer

The answer of The assumption of ________ allows a decision...

Question 15

________ represent choices the decision maker can control.

Accepted Answer

The answer of ________ represent choices the decision maker can...

Question 16

The simplex method is an interactive algebraic procedure for solving linear programming problems.

Accepted Answer

A) True 
 B)False

Question 17

Which of the following statements regarding linear programming is NOT true?

Accepted Answer

A) A linear programming problem can have more than one optimal solution. 
B) Most real-world linear programming problems are solved on a computer. 
C) If a binding constraint were relaxed,the optimal solution wouldn't change. 
D) A surplus variable is added to a > constraint to convert it to an equality. 
A) A linear programming problem can have more than one optimal solution. 
B) Most real-world linear programming problems are solved on a computer. 
C) If a binding constraint were relaxed,the optimal solution wouldn't change. 
D) A surplus variable is added to a > constraint to convert it to an equality.

Question 18

________ occurs in a linear programming problem when the number of nonzero variables in the optimal solution is fewer than the number of constraints.

Accepted Answer

The answer of ________ occurs in a linear programming problem...

Question 19

A parameter is a region that represents all permissible combinations of the decision variables in a linear programming model.

Accepted Answer

A) True 
 B)False

Question 20

What are some potential abuses or misuses of linear programming (beyond violation of basic assumptions)?

Accepted Answer

Answers will vary,but may include a disc

________ is the amount by which the left-hand side falls short of the right-hand side in a linear programming model.

The objective function Maximize Z = 3x2 = 4y is appropriate.

What are the assumptions of linear programming? Provide examples of each.

If merely rounding up or rounding down a result for a decision variable is not sufficient when they must be expressed in whole units,then a decision maker might instead use ________ to analyze the situation.

In linear programming,each parameter is assumed to be known with certainty.

________ is useful for allocating scarce resources among competing demands.

A binding constraint is the amount by which the left-hand side falls short of the right-hand side.

What is the meaning of a slack or surplus variable?

A constraint is a limitation that restricts the permissible choices.

The interval over which the right-hand-side parameter can vary while its shadow price remains valid is the ________.

The graphical method is a practical method for solving product mix problems of any size,provided the decision maker has sufficient quantities of graph paper.

The assumption of ________ allows a decision maker to combine the profit from one product with the profit from another to realize the total profit from a feasible solution.

________ represent choices the decision maker can control.

The simplex method is an interactive algebraic procedure for solving linear programming problems.

Which of the following statements regarding linear programming is NOT true?

________ occurs in a linear programming problem when the number of nonzero variables in the optimal solution is fewer than the number of constraints.

A parameter is a region that represents all permissible combinations of the decision variables in a linear programming model.

What are some potential abuses or misuses of linear programming (beyond violation of basic assumptions)?

Creating Customer Value Through Operations

Supply Chain Management

Process Configuration

Capacity

Inventory Management

Quality and Process Improvement

Lean Systems

Managing Projects

Location and Layout

Managing Demand and Forecasting

Operations Planning and Scheduling

Resource Planning

Waiting Lines

Decision Making

Financial Analysis

Work Measurement

Learning Curve Analysis

Computer-Integrated Manufacturing

Acceptance Sampling Plans

Simulation

Special Inventory Models

Filters

Exam 22: Linear Programming

________ is the amount by which the left-hand side falls short of the right-hand side in a linear programming model.

The objective function Maximize Z = 3x2 = 4y is appropriate.

What are the assumptions of linear programming? Provide examples of each.

If merely rounding up or rounding down a result for a decision variable is not sufficient when they must be expressed in whole units,then a decision maker might instead use ________ to analyze the situation.

In linear programming,each parameter is assumed to be known with certainty.

________ is useful for allocating scarce resources among competing demands.

A binding constraint is the amount by which the left-hand side falls short of the right-hand side.

What is the meaning of a slack or surplus variable?

A constraint is a limitation that restricts the permissible choices.

The interval over which the right-hand-side parameter can vary while its shadow price remains valid is the ________.

The graphical method is a practical method for solving product mix problems of any size,provided the decision maker has sufficient quantities of graph paper.

The assumption of ________ allows a decision maker to combine the profit from one product with the profit from another to realize the total profit from a feasible solution.

________ represent choices the decision maker can control.

The simplex method is an interactive algebraic procedure for solving linear programming problems.

Which of the following statements regarding linear programming is NOT true?

________ occurs in a linear programming problem when the number of nonzero variables in the optimal solution is fewer than the number of constraints.

A parameter is a region that represents all permissible combinations of the decision variables in a linear programming model.

What are some potential abuses or misuses of linear programming (beyond violation of basic assumptions)?

Creating Customer Value Through Operations

Supply Chain Management

Process Configuration

Capacity

Inventory Management

Quality and Process Improvement

Lean Systems

Managing Projects

Location and Layout

Managing Demand and Forecasting

Operations Planning and Scheduling

Resource Planning

Waiting Lines

Decision Making

Financial Analysis

Work Measurement

Learning Curve Analysis

Computer-Integrated Manufacturing

Acceptance Sampling Plans

Simulation

Special Inventory Models

Filters