Question 1

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

Accepted Answer

A) True 
 B)False

Question 2

A constraint with positive slack or surplus is called a

Accepted Answer

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

Question 3

Consider the following linear programming problem: Maximize 20X + 30Y
Subject to: X + Y ≤ 80
8X + 9Y ≤ 600
3X + 2Y ≥ 400
X, Y ≥ 0
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. 
A) there is no feasible solution. 
B) there is a redundant constraint. 
C) there are multiple optimal solutions. 
D) this cannot be solved graphically.

Question 4

Solve the following linear programming problem using the corner point method:
Maximize 10X + 1Y
Subject to: 4X + 3Y ≤ 36
2X + 4Y ≤ 40
Y ≥ 3
X, Y ≥ 0

Accepted Answer

Feasible corner poin

Question 5

An LP formulation typically requires finding the maximum value of an objective while simultaneously maximizing usage of the resource constraints.

Accepted Answer

A) True 
 B)False

Question 6

When appropriate, the optimal solution to a maximization linear programming problem can be found by graphing the feasible region and

Accepted Answer

A) finding the profit at every corner point of the feasible region to see which one gives the highest value. 
B) moving the isoprofit lines towards the origin in a parallel fashion until the last point in the feasible region is encountered. 
C) locating the point that is highest on the graph. 
D) sliding the constraints to find the greatest point of intersection. 
A) finding the profit at every corner point of the feasible region to see which one gives the highest value. 
B) moving the isoprofit lines towards the origin in a parallel fashion until the last point in the feasible region is encountered. 
C) locating the point that is highest on the graph. 
D) sliding the constraints to find the greatest point of intersection.

Question 7

The Greatest Generation Food Company wishes to introduce a new brand of pureed ready-to-eat meals (composed of pureed chicken and pureed liver meat products)that meets certain nutritional requirements.The liver-flavored product contains 1 unit of nutrient A and 2 units of nutrient B, while the chicken-flavored product contains 1 unit of nutrient A and 4 units of nutrient B.According to federal requirements, there must be at least 40 units of nutrient A and 60 units of nutrient B in a package of the new meals.In addition, the company has decided that there can be no more than 15 units of liver-flavored meat product in a package.It costs 1 cent to make a liver-flavored product and 2 cents to make a chicken-flavored product.Are there any redundant constraints in this scenario?

Accepted Answer

A) L + C ≤ 100 
B) L + 2C ≥ 40 
C) Minimize 2L + 4C ≥ 60 
D) There are no redundant constraints. 
A) L + C ≤ 100 
B) L + 2C ≥ 40 
C) Minimize 2L + 4C ≥ 60 
D) There are no redundant constraints.

Question 8

Constraints do not need to be entered one at a time when using Solver.

Accepted Answer

A) True 
 B)False

Question 9

As a supervisor of a production department, you must decide the daily production totals of a certain product that has two models, the Deluxe and the Special.The profit on the Deluxe model is $12 per unit and the Special's profit is $10.Each model goes through two phases in the production process, and there are only 100 hours available daily at the construction stage and only 80 hours available at the finishing and inspection stage.Each Deluxe model requires 20 minutes of construction time and 10 minutes of finishing and inspection time.Each Special model requires 15 minutes of construction time and 15 minutes of finishing and inspection time.The company has also decided that the Special model must comprise at least 40 percent of the production total.What is an appropriate constraint for the construction time?

Accepted Answer

A) 20D + 15S ≥ 6000 
B) 20D + 15S ≤ 100 
C) 20D + 15S ≤ 6000 
D) 20D + 15S ≥ 100 
A) 20D + 15S ≥ 6000 
B) 20D + 15S ≤ 100 
C) 20D + 15S ≤ 6000 
D) 20D + 15S ≥ 100

Question 10

Resource restrictions are called constraints.

Accepted Answer

A) True 
 B)False

Question 11

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

Accepted Answer

A) True 
 B)False

Question 12

You can actually take in $453.60 with this setup.Suppose your most important customer comes to you and demands you make her an order of Bananas Foster.What is your profit if you add one recipe of Bananas Foster to your production mix?

Accepted Answer

A) $446.20 
B) $453.60 
C) $461.00 
D) $473.60 
A) $446.20 
B) $453.60 
C) $461.00 
D) $473.60

Question 13

What is the most you would pay for one more cup of pecans?

Accepted Answer

A) $0 
B) $0.20 
C) $$0.24 
D) $0.40 
A) $0 
B) $0.20 
C) $$0.24 
D) $0.40

Question 14

The rationality assumption implies that solutions need not be in whole numbers (integers).

Accepted Answer

A) True 
 B)False

Question 15

Which of the following is a basic assumption of linear programming?

Accepted Answer

A) The condition of uncertainty exists. 
B) Independence exists for the activities. 
C) Proportionality exists in the objective function and constraints. 
D) Divisibility does not exist, allowing only integer solutions. 
A) The condition of uncertainty exists. 
B) Independence exists for the activities. 
C) Proportionality exists in the objective function and constraints. 
D) Divisibility does not exist, allowing only integer solutions.

Question 16

Consider the sensitivity report above.
(a)Which constraints are binding?
(b)What is the increase in the objective value if 30 Cabbage are added?

Accepted Answer

(a)Cabbage

Question 17

You don't use any of the

Accepted Answer

A) pecans. 
B) rum. 
C) cane syrup. 
D) vanilla. 
A) pecans. 
B) rum. 
C) cane syrup. 
D) vanilla.

Question 18

As a supervisor of a production department, you must decide the daily production totals of a certain product that has two models, the Deluxe and the Special.The profit on the Deluxe model is $12 per unit and the Special's profit is $10.Each model goes through two phases in the production process, and there are only 100 hours available daily at the construction stage and only 80 hours available at the finishing and inspection stage.Each Deluxe model requires 20 minutes of construction time and 10 minutes of finishing and inspection time.Each Special model requires 15 minutes of construction time and 15 minutes of finishing and inspection time.The company has also decided that the Special model must comprise at least 40 percent of the production total.The optimal product mix should include

Accepted Answer

A) 120D's. 
B) 120S's. 
C) 200D's. 
D) 200S's. 
A) 120D's. 
B) 120S's. 
C) 200D's. 
D) 200S's.

Question 19

The term slack is associated with ≥ constraints.

Accepted Answer

A) True 
 B)False

Question 20

Consider the following constraints from a two-variable linear program.
1.X ≥ 0
2.Y ≥ 0
3.X + Y ≤ 50
If the optimal corner point lies at the intersection of constraints (2)and (3), what is the optimal solution (X, Y)?

Accepted Answer

Y = 0, so X + 0 = 50

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

A constraint with positive slack or surplus is called a

Consider the following linear programming problem: Maximize 20X + 30Y Subject to: X + Y ≤ 80 8X + 9Y ≤ 600 3X + 2Y ≥ 400 X, Y ≥ 0 This is a special case of a linear programming problem in which

Solve the following linear programming problem using the corner point method: Maximize 10X + 1Y Subject to: 4X + 3Y ≤ 36 2X + 4Y ≤ 40 Y ≥ 3 X, Y ≥ 0

An LP formulation typically requires finding the maximum value of an objective while simultaneously maximizing usage of the resource constraints.

When appropriate, the optimal solution to a maximization linear programming problem can be found by graphing the feasible region and

Constraints do not need to be entered one at a time when using Solver.

Resource restrictions are called constraints.

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

You can actually take in $453.60 with this setup.Suppose your most important customer comes to you and demands you make her an order of Bananas Foster.What is your profit if you add one recipe of Bananas Foster to your production mix?

What is the most you would pay for one more cup of pecans?

The rationality assumption implies that solutions need not be in whole numbers (integers).

Which of the following is a basic assumption of linear programming?

Consider the sensitivity report above. (a)Which constraints are binding? (b)What is the increase in the objective value if 30 Cabbage are added?

You don't use any of the

The term slack is associated with ≥ constraints.

Consider the following constraints from a two-variable linear program. 1.X ≥ 0 2.Y ≥ 0 3.X + Y ≤ 50 If the optimal corner point lies at the intersection of constraints (2)and (3), what is the optimal solution (X, Y)?

Introduction to Quantitative Analysis

Probability Concepts and Applications

Decision Analysis

Regression Models

Forecasting

Inventory Control Models

Linear Programming Applications

Transportation, Assignment, and Network Models

Integer Programming, Goal Programming, and Nonlinear Programming

Project Management

Waiting Lines and Queuing Theory Models

Simulation Modeling

Markov Analysis

Statistical Quality Control

Analytic Hierarchy Process

Dynamic Programming

Decision Theory and the Normal Distribution

Game Theory

Mathematical Tools: Determinants and Matrices

Calculus-Based Optimization

Linear Programming: The Simplex Method

Transportation, Assignment, and Network Algorithms

Filters

Exam 7: Linear Programming Models: Graphical and Computer Methods

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

A constraint with positive slack or surplus is called a

Consider the following linear programming problem: Maximize 20X + 30Y Subject to: X + Y ≤ 80 8X + 9Y ≤ 600 3X + 2Y ≥ 400 X, Y ≥ 0 This is a special case of a linear programming problem in which

Solve the following linear programming problem using the corner point method: Maximize 10X + 1Y Subject to: 4X + 3Y ≤ 36 2X + 4Y ≤ 40 Y ≥ 3 X, Y ≥ 0

An LP formulation typically requires finding the maximum value of an objective while simultaneously maximizing usage of the resource constraints.

When appropriate, the optimal solution to a maximization linear programming problem can be found by graphing the feasible region and

Constraints do not need to be entered one at a time when using Solver.

Resource restrictions are called constraints.

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

You can actually take in $453.60 with this setup.Suppose your most important customer comes to you and demands you make her an order of Bananas Foster.What is your profit if you add one recipe of Bananas Foster to your production mix?

What is the most you would pay for one more cup of pecans?

The rationality assumption implies that solutions need not be in whole numbers (integers).

Which of the following is a basic assumption of linear programming?

Consider the sensitivity report above. (a)Which constraints are binding? (b)What is the increase in the objective value if 30 Cabbage are added?

You don't use any of the

The term slack is associated with ≥ constraints.

Consider the following constraints from a two-variable linear program. 1.X ≥ 0 2.Y ≥ 0 3.X + Y ≤ 50 If the optimal corner point lies at the intersection of constraints (2)and (3), what is the optimal solution (X, Y)?

Introduction to Quantitative Analysis

Probability Concepts and Applications

Decision Analysis

Regression Models

Forecasting

Inventory Control Models

Linear Programming Applications

Transportation, Assignment, and Network Models

Integer Programming, Goal Programming, and Nonlinear Programming

Project Management

Waiting Lines and Queuing Theory Models

Simulation Modeling

Markov Analysis

Statistical Quality Control

Analytic Hierarchy Process

Dynamic Programming

Decision Theory and the Normal Distribution

Game Theory

Mathematical Tools: Determinants and Matrices

Calculus-Based Optimization

Linear Programming: The Simplex Method

Transportation, Assignment, and Network Algorithms

Filters