Question 1

The difference between the left-hand side and right-hand side of a less-than-or-equal-to constraint is referred to as

Accepted Answer

A) surplus. 
B) constraint. 
C) slack. 
D) shadow price. 
E) None of the above 
A) surplus. 
B) constraint. 
C) slack. 
D) shadow price. 
E) None of the above C

Question 2

Two models of a product - Regular (X)and Deluxe (Y)- are produced by a company.A linear programming model is used to determine the production schedule.The formulation is as follows:   The optimal solution is X = 100,Y = 0. Which of these constraints is redundant?

Accepted Answer

A) the first constraint 
B) the second constraint 
C) the third constraint 
D) All of the above 
E) None of the above 
A) the first constraint 
B) the second constraint 
C) the third constraint 
D) All of the above 
E) None of the above B

Question 3

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

Accepted Answer

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

Question 4

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

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

Accepted Answer

A) (0,60) 
B) (105,0) 
C) (120,0) 
D) (100,10) 
E) None of the above 
A) (0,60) 
B) (105,0) 
C) (120,0) 
D) (100,10) 
E) None of the above

Question 7

Consider the sensitivity report below for the problems which follow.  
-The optimal solution to this linear program is

Accepted Answer

A) x1 = 0,x2 = 0. 
B) x1 = 34,x2 = 40. 
C) x1 = 6,x2 = 11. 
D) x1 = 7.33,x2 = 6. 
E) x1 = 3,x2 = 6. 
A) x1 = 0,x2 = 0. 
B) x1 = 34,x2 = 40. 
C) x1 = 6,x2 = 11. 
D) x1 = 7.33,x2 = 6. 
E) x1 = 3,x2 = 6.

Question 8

Which of the following is not an assumption of LP?

Accepted Answer

A) simultaneity 
B) certainty 
C) proportionality 
D) divisibility 
E) additivity 
A) simultaneity 
B) certainty 
C) proportionality 
D) divisibility 
E) additivity

Question 9

Which of the following is not a part of every linear programming problem formulation?

Accepted Answer

A) an objective function 
B) a set of constraints 
C) non-negativity constraints 
D) a redundant constraint 
E) maximization or minimization of a linear function 
A) an objective function 
B) a set of constraints 
C) non-negativity constraints 
D) a redundant constraint 
E) maximization or minimization of a linear function

Question 10

In order for a linear programming problem to have multiple solutions,the solution must exist

Accepted Answer

A) at the intersection of the non-negativity constraints. 
B) on a non-redundant constraint parallel to the objective function. 
C) at the intersection of the objective function and a constraint. 
D) at the intersection of three or more constraints. 
E) None of the above 
A) at the intersection of the non-negativity constraints. 
B) on a non-redundant constraint parallel to the objective function. 
C) at the intersection of the objective function and a constraint. 
D) at the intersection of three or more constraints. 
E) None of the above

Question 11

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

Accepted Answer

A) (30,60) 
B) (105,5) 
C) (0,210) 
D) (100,10) 
E) None of the above 
A) (30,60) 
B) (105,5) 
C) (0,210) 
D) (100,10) 
E) None of the above

Question 12

The Fido Dog Food Company wishes to introduce a new brand of dog biscuits (composed of chicken and liver-flavored biscuits)that meets certain nutritional requirements.The liver-flavored biscuits contain 1 unit of nutrient A and 2 units of nutrient B,while the chicken-flavored ones contain 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 biscuit mix.In addition,the company has decided that there can be no more than 15 liver-flavored biscuits in a package.If it costs 1 cent to make a liver-flavored biscuit and 2 cents to make a chicken-flavored one,what is the optimal product mix for a package of the biscuits in order to minimize the firm's cost?
(a)Formulate this as a linear programming problem.
(b)Find the optimal solution for this problem graphically.
(c)Are any constraints redundant? If so,which one or ones?
(d)What is the total cost of a package of dog biscuits using the optimal mix?

Accepted Answer

(a) @#IMG-DLM& (b)Corner points (0,40)an

Question 13

If the isoprofit line is not parallel to a constraint,then the solution must be unique.

Accepted Answer

A) True 
 B)False

Question 14

Suppose a linear programming (maximization)problem has been solved and the optimal value of the objective function is $300.Suppose a constraint is removed from this problem.Explain how this might affect each of the following:
(a)the feasible region.
(b)the optimal value of the objective function.

Accepted Answer

(a)Removing a constraint may,if the cons

Question 15

Which of the following functions is not linear?

Accepted Answer

A) 5X + 3Z 
B) 3X + 4Y + Z - 3 
C) 2X + 5YZ 
D) Z 
E) 2X - 5Y + 2Z 
A) 5X + 3Z 
B) 3X + 4Y + Z - 3 
C) 2X + 5YZ 
D) Z 
E) 2X - 5Y + 2Z

Question 16

Two advertising media are being considered for promotion of a product.Radio ads cost $400 each,while newspaper ads cost $600 each.The total budget is $7,200 per week.The total number of ads should be at least 15,with at least 2 of each type.Each newspaper ad reaches 6,000 people,while each radio ad reaches 2,000 people.The company wishes to reach as many people as possible while meeting all the constraints stated.How many ads of each type should be placed?

Accepted Answer

@#IMG-DLM& Feasible corner points (R,N):

Question 17

Define dual price.

Accepted Answer

The dual price for a constrain

Question 18

Upon retirement,Mr.Klaws started to make two types of children's wooden toys in his shop-Wuns and Toos.Wuns yield a variable profit of $9 each and Toos have a contribution margin of $8 each.Even though his electric saw overheats,he can make 7 Wuns or 14 Toos each day.Since he doesn't have equipment for drying the lacquer finish he puts on the toys,the drying operation limits him to 16 Wuns or 8 Toos per day.
(a)Solve this problem using the corner point method.
(b)For what profit ratios would the optimum solution remain the optimum solution?

Accepted Answer

@#IMG-DLM& Corner points (0,0)

Question 19

How does the case of alternate optimal solutions,as a special case in linear programming,compare to the two other special cases of infeasibility and unboundedness?

Accepted Answer

With multiple alternate solutions,any of

Question 20

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

The difference between the left-hand side and right-hand side of a less-than-or-equal-to constraint is referred to as

Two models of a product - Regular (X)and Deluxe (Y)- are produced by a company.A linear programming model is used to determine the production schedule.The formulation is as follows: The optimal solution is X = 100,Y = 0. Which of these constraints is redundant?

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

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

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

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

Consider the sensitivity report below for the problems which follow. -The optimal solution to this linear program is

Which of the following is not an assumption of LP?

Which of the following is not a part of every linear programming problem formulation?

In order for a linear programming problem to have multiple solutions,the solution must exist

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

If the isoprofit line is not parallel to a constraint,then the solution must be unique.

Suppose a linear programming (maximization)problem has been solved and the optimal value of the objective function is $300.Suppose a constraint is removed from this problem.Explain how this might affect each of the following: (a)the feasible region. (b)the optimal value of the objective function.

Which of the following functions is not linear?

Define dual price.

How does the case of alternate optimal solutions,as a special case in linear programming,compare to the two other special cases of infeasibility and unboundedness?

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

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

The difference between the left-hand side and right-hand side of a less-than-or-equal-to constraint is referred to as

Two models of a product - Regular (X)and Deluxe (Y)- are produced by a company.A linear programming model is used to determine the production schedule.The formulation is as follows: The optimal solution is X = 100,Y = 0. Which of these constraints is redundant?

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

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

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

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

Consider the sensitivity report below for the problems which follow. -The optimal solution to this linear program is

Which of the following is not an assumption of LP?

Which of the following is not a part of every linear programming problem formulation?

In order for a linear programming problem to have multiple solutions,the solution must exist

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

If the isoprofit line is not parallel to a constraint,then the solution must be unique.

Suppose a linear programming (maximization)problem has been solved and the optimal value of the objective function is $300.Suppose a constraint is removed from this problem.Explain how this might affect each of the following: (a)the feasible region. (b)the optimal value of the objective function.

Which of the following functions is not linear?

Define dual price.

How does the case of alternate optimal solutions,as a special case in linear programming,compare to the two other special cases of infeasibility and unboundedness?

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

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