Question 1

Resource restrictions are called constraints.

Accepted Answer

A) True 
 B)False

Question 2

Consider the following linear programming problem:   This is a special case of a linear programming problem in which

Accepted Answer

A)  there is no feasible solution. 
B)  there is a redundant constraint. 
C)  there are multiple optimal solutions. 
D)  this cannot be solved graphically. 
E)  None of the above 
A)  there is no feasible solution. 
B)  there is a redundant constraint. 
C)  there are multiple optimal solutions. 
D)  this cannot be solved graphically. 
E)  None of the above

Question 3

The mathematical theory behind linear programming states that an optimal solution to any problem will lie at a(n) ________ of the feasible region.

Accepted Answer

A)  interior point or center 
B)  maximum point or minimum point 
C)  corner point or extreme point 
D)  interior point or extreme point 
E)  None of the above 
A)  interior point or center 
B)  maximum point or minimum point 
C)  corner point or extreme point 
D)  interior point or extreme point 
E)  None of the above

Question 4

In the term linear programming, the word programming comes from the phrase "computer programming."

Accepted Answer

A) True 
 B)False

Question 5

Consider the following linear programming problem:   The feasible corner points are (48,84), (0,120), (0,0), (90,0). What is the maximum possible value for the objective function?

Accepted Answer

A)  1032 
B)  1200 
C)  360 
D)  1600 
E)  None of the above 
A)  1032 
B)  1200 
C)  360 
D)  1600 
E)  None of the above

Question 6

A constraint with positive slack or surplus is called a

Accepted Answer

A)  nonbinding constraint. 
B)  resource constraint. 
C)  binding constraint. 
D)  nonlinear constraint. 
E)  linear constraint. 
A)  nonbinding constraint. 
B)  resource constraint. 
C)  binding constraint. 
D)  nonlinear constraint. 
E)  linear constraint.

Question 7

Determine where the following two constraints intersect.
2X - 4Y = 800
−X + 6Y ≥ -200

Accepted Answer

The answer of Determine where the following two constraints intersect.
2X...

Question 8

The existence of non-negativity constraints in a two-variable linear program implies that we are always working in the northwest quadrant of a graph.

Accepted Answer

A) True 
 B)False

Question 9

Define infeasibility with respect to an LP solution.

Accepted Answer

This occurs when the

Question 10

Consider the following linear programming problem:   What is the optimum solution to this problem (X,Y)?

Accepted Answer

A)  (0,0) 
B)  (50,0) 
C)  (0,100) 
D)  (400,0) 
E)  None of the above 
A)  (0,0) 
B)  (50,0) 
C)  (0,100) 
D)  (400,0) 
E)  None of the above

Question 11

What type of problems use LP to decide how much of each product to make, given a series of resource restrictions?

Accepted Answer

A)  resource mix 
B)  resource restriction 
C)  product restriction 
D)  resource allocation 
E)  product mix 
A)  resource mix 
B)  resource restriction 
C)  product restriction 
D)  resource allocation 
E)  product mix

Question 12

Consider the following linear programming problem:   Which of the following points (X,Y) is feasible?

Accepted Answer

A)  (50,40) 
B)  (30,50) 
C)  (60,30) 
D)  (90,20) 
E)  None of the above 
A)  (50,40) 
B)  (30,50) 
C)  (60,30) 
D)  (90,20) 
E)  None of the above

Question 13

The corner point solution method

Accepted Answer

A)  will always provide one, and only one, optimum. 
B)  will yield different results from the isoprofit line solution method. 
C)  requires that the profit from all corners of the feasible region be compared. 
D)  requires that all corners created by all constraints be compared. 
E)  will not provide a solution at an intersection or corner where a non-negativity constraint is involved. 
A)  will always provide one, and only one, optimum. 
B)  will yield different results from the isoprofit line solution method. 
C)  requires that the profit from all corners of the feasible region be compared. 
D)  requires that all corners created by all constraints be compared. 
E)  will not provide a solution at an intersection or corner where a non-negativity constraint is involved.

Question 14

When two or more constraints conflict with one another, we have a condition called unboundedness.

Accepted Answer

A) True 
 B)False

Question 15

An objective function is necessary in a maximization problem but is not required in a minimization problem.

Accepted Answer

A) True 
 B)False

Question 16

Solve the following linear programming problem using the corner point method:

Accepted Answer

Feasible corner poin

Question 17

In a linear program, the constraints must be linear, but the objective function may be nonlinear.

Accepted Answer

A) True 
 B)False

Question 18

Consider the following constraints from a linear programming problem: 2X + Y ≤ 200
X + 2Y ≤ 200
X, Y ≥ 0
If these are the only constraints, which of the following points (X,Y) cannot be the optimal solution?

Accepted Answer

A)  (0, 0) 
B)  (0, 200) 
C)  (0,100) 
D)  (100, 0) 
E)  (66.67, 66.67) 
A)  (0, 0) 
B)  (0, 200) 
C)  (0,100) 
D)  (100, 0) 
E)  (66.67, 66.67)

Question 19

In some instances, an infeasible solution may be the optimum found by the corner point method.

Accepted Answer

A) True 
 B)False

Question 20

If one changes the contribution rates in the objective function of an LP,

Accepted Answer

A)  the feasible region will change. 
B)  the slope of the isoprofit or isocost line will change. 
C)  the optimal solution to the LP is sure to no longer be optimal. 
D)  All of the above 
E)  None of the above 
A)  the feasible region will change. 
B)  the slope of the isoprofit or isocost line will change. 
C)  the optimal solution to the LP is sure to no longer be optimal. 
D)  All of the above 
E)  None of the above

Resource restrictions are called constraints.

Consider the following linear programming problem: This is a special case of a linear programming problem in which

The mathematical theory behind linear programming states that an optimal solution to any problem will lie at a(n) ________ of the feasible region.

In the term linear programming, the word programming comes from the phrase "computer programming."

Consider the following linear programming problem: The feasible corner points are (48,84), (0,120), (0,0), (90,0). What is the maximum possible value for the objective function?

A constraint with positive slack or surplus is called a

Determine where the following two constraints intersect. 2X - 4Y = 800 −X + 6Y ≥ -200

The existence of non-negativity constraints in a two-variable linear program implies that we are always working in the northwest quadrant of a graph.

Define infeasibility with respect to an LP solution.

Consider the following linear programming problem: What is the optimum solution to this problem (X,Y)?

What type of problems use LP to decide how much of each product to make, given a series of resource restrictions?

Consider the following linear programming problem: Which of the following points (X,Y) is feasible?

The corner point solution method

When two or more constraints conflict with one another, we have a condition called unboundedness.

An objective function is necessary in a maximization problem but is not required in a minimization problem.

Solve the following linear programming problem using the corner point method:

In a linear program, the constraints must be linear, but the objective function may be nonlinear.

Consider the following constraints from a linear programming problem: 2X + Y ≤ 200 X + 2Y ≤ 200 X, Y ≥ 0 If these are the only constraints, which of the following points (X,Y) cannot be the optimal solution?

In some instances, an infeasible solution may be the optimum found by the corner point method.

If one changes the contribution rates in the objective function of an LP,

Introduction to Quantitative Analysis

Probability Concepts and Applications

Decision Analysis

Regression Models

Forecasting

Inventory Control Models

Linear Programming Applications

Transportation and Assignment Models

Integer Programming, Goal Programming, and Nonlinear Programming

Network Models

Project Management

Waiting Lines and Queuing Theory Models

Simulation Modeling

Markov Analysis

Statistical Quality Control

Filters

Exam 7: Linear Programming Models: Graphical and Computer Methods

Resource restrictions are called constraints.

Consider the following linear programming problem: This is a special case of a linear programming problem in which

The mathematical theory behind linear programming states that an optimal solution to any problem will lie at a(n) ________ of the feasible region.

In the term linear programming, the word programming comes from the phrase "computer programming."

Consider the following linear programming problem: The feasible corner points are (48,84), (0,120), (0,0), (90,0). What is the maximum possible value for the objective function?

A constraint with positive slack or surplus is called a

Determine where the following two constraints intersect. 2X - 4Y = 800 −X + 6Y ≥ -200

The existence of non-negativity constraints in a two-variable linear program implies that we are always working in the northwest quadrant of a graph.

Define infeasibility with respect to an LP solution.

Consider the following linear programming problem: What is the optimum solution to this problem (X,Y)?

What type of problems use LP to decide how much of each product to make, given a series of resource restrictions?

Consider the following linear programming problem: Which of the following points (X,Y) is feasible?

The corner point solution method

When two or more constraints conflict with one another, we have a condition called unboundedness.

An objective function is necessary in a maximization problem but is not required in a minimization problem.

Solve the following linear programming problem using the corner point method:

In a linear program, the constraints must be linear, but the objective function may be nonlinear.

Consider the following constraints from a linear programming problem: 2X + Y ≤ 200 X + 2Y ≤ 200 X, Y ≥ 0 If these are the only constraints, which of the following points (X,Y) cannot be the optimal solution?

In some instances, an infeasible solution may be the optimum found by the corner point method.

If one changes the contribution rates in the objective function of an LP,

Introduction to Quantitative Analysis

Probability Concepts and Applications

Decision Analysis

Regression Models

Forecasting

Inventory Control Models

Linear Programming Applications

Transportation and Assignment Models

Integer Programming, Goal Programming, and Nonlinear Programming

Network Models

Project Management

Waiting Lines and Queuing Theory Models

Simulation Modeling

Markov Analysis

Statistical Quality Control

Filters