Question 1

The simultaneous equation method is

Accepted Answer

A) an alternative to the corner point method. 
B) useful only in minimization methods. 
C) an algebraic means for solving the intersection of two or more constraint equations. 
D) useful only when more than two product variables exist in a product mix problem. 
E) None of the above 
A) an alternative to the corner point method. 
B) useful only in minimization methods. 
C) an algebraic means for solving the intersection of two or more constraint equations. 
D) useful only when more than two product variables exist in a product mix problem. 
E) None of the above

Question 2

Consider the sensitivity report below:   (a)Which constraints are binding?
(b)Which constraints are non-binding?
(c)What is the increase in the objective value if 10 blades are added?

Accepted Answer

(a)Bolts,Blades,and

Question 3

When a constraint line bounding a feasible region has the same slope as an isoprofit line,

Accepted Answer

A) there may be more than one optimum solution. 
B) the problem involves redundancy. 
C) an error has been made in the problem formulation. 
D) a condition of infeasibility exists. 
E) None of the above 
A) there may be more than one optimum solution. 
B) the problem involves redundancy. 
C) an error has been made in the problem formulation. 
D) a condition of infeasibility exists. 
E) None of the above

Question 4

A plastic parts supplier produces two types of plastic parts used for electronics.Type 1 requires 30 minutes of labor and 45 minutes of machine time.Type 2 requires 60 minutes of machine hours and 75 minutes of labor.There are 600 hours available per week of labor and 800 machine hours available.The demand for custom molds and plastic parts are identical.Type 1 has a profit margin of $25 a unit and Type 2 has a profit margin of $45 a unit.The plastic parts supplier must choose the quantity of Product A and Product B to produce which maximizes profit.
(a)Formulate this as a linear programming problem.
(b)Find the solution that gives the maximum profit using either QM for Windows or Excel.

Accepted Answer

(a) @#IMG-DLM& (b)X₁

Question 5

Infeasibility in a linear programming problem occurs when

Accepted Answer

A) there is an infinite solution. 
B) a constraint is redundant. 
C) more than one solution is optimal. 
D) the feasible region is unbounded. 
E) there is no solution that satisfies all the constraints given. 
A) there is an infinite solution. 
B) a constraint is redundant. 
C) more than one solution is optimal. 
D) the feasible region is unbounded. 
E) there is no solution that satisfies all the constraints given.

Question 6

Which of the following is not acceptable as a constraint in a linear programming problem (maximization)?

Accepted Answer

A) Constraint 1 
B) Constraint 2 
C) Constraint 3 
D) Constraint 4 
E) None of the above 
A) Constraint 1 
B) Constraint 2 
C) Constraint 3 
D) Constraint 4 
E) None of the above

Question 7

A straight line representing all non-negative combinations of X1 and X2 for a particular profit level is called a(n)

Accepted Answer

A) constraint line. 
B) objective line. 
C) sensitivity line. 
D) profit line. 
E) isoprofit line. 
A) constraint line. 
B) objective line. 
C) sensitivity line. 
D) profit line. 
E) isoprofit line.

Question 8

Susanna Nanna is the production manager for a furniture manufacturing company.The company produces tables (X)and chairs (Y).Each table generates a profit of $80 and requires 3 hours of assembly time and 4 hours of finishing time.Each chair generates $50 of profit and requires 3 hours of assembly time and 2 hours of finishing time.There are 360 hours of assembly time and 240 hours of finishing time available each month.The following linear programming problem represents this situation.
Maximize 80X + 50Y
Subject to: 3X + 3Y ≤ 360
4X + 2Y ≤ 240
X,Y ≥ 0
The optimal solution is X = 0,and Y = 120.
(a)What would the maximum possible profit be?
(b)How many hours of assembly time would be used to maximize profit?
(c)If a new constraint,2X + 2Y ≤ 400,were added,what would happen to the maximum possible profit?

Accepted Answer

(a)6000, (

Question 9

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 10

Consider the following linear programming problem:   The maximum possible value for the objective function is

Accepted Answer

A) 360. 
B) 480. 
C) 1520. 
D) 1560. 
E) None of the above 
A) 360. 
B) 480. 
C) 1520. 
D) 1560. 
E) None of the above

Question 11

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 12

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.
(a)Formulate this as a linear programming problem.
(b)Find the solution that gives the maximum profit.

Accepted Answer

(a) @#IMG-DLM& (b)Optimal solu

Question 13

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 14

If the addition of a constraint to a linear programming problem does not change the solution,the constraint is said to be

Accepted Answer

A) unbounded. 
B) non-negative. 
C) infeasible. 
D) redundant. 
E) bounded. 
A) unbounded. 
B) non-negative. 
C) infeasible. 
D) redundant. 
E) bounded.

Question 15

Resource restrictions are called constraints.

Accepted Answer

A) True 
 B)False

Question 16

List the 7 properties of linear programs

Accepted Answer

1.One objective function
2.One or more c

Question 17

Which of the following is not a property of all linear programming problems?

Accepted Answer

A) the presence of restrictions 
B) optimization of some objective 
C) a computer program 
D) alternate courses of action to choose from 
E) usage of only linear equations and inequalities 
A) the presence of restrictions 
B) optimization of some objective 
C) a computer program 
D) alternate courses of action to choose from 
E) usage of only linear equations and inequalities

Question 18

Define unboundedness with respect to an LP solution.

Accepted Answer

This occurs when a linear prog

Question 19

Define infeasibility with respect to an LP solution.

Accepted Answer

This occurs when the

Question 20

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

The simultaneous equation method is

Consider the sensitivity report below: (a)Which constraints are binding? (b)Which constraints are non-binding? (c)What is the increase in the objective value if 10 blades are added?

When a constraint line bounding a feasible region has the same slope as an isoprofit line,

Infeasibility in a linear programming problem occurs when

Which of the following is not acceptable as a constraint in a linear programming problem (maximization)?

A straight line representing all non-negative combinations of X₁ and X₂ for a particular profit level is called a(n)

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?

Consider the following linear programming problem: The maximum possible value for the objective function is

The corner point solution method

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

If the addition of a constraint to a linear programming problem does not change the solution,the constraint is said to be

Resource restrictions are called constraints.

List the 7 properties of linear programs

Which of the following is not a property of all linear programming problems?

Define unboundedness with respect to an LP solution.

Define infeasibility with respect to an LP solution.

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

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 simultaneous equation method is

Consider the sensitivity report below: (a)Which constraints are binding? (b)Which constraints are non-binding? (c)What is the increase in the objective value if 10 blades are added?

When a constraint line bounding a feasible region has the same slope as an isoprofit line,

Infeasibility in a linear programming problem occurs when

Which of the following is not acceptable as a constraint in a linear programming problem (maximization)?

A straight line representing all non-negative combinations of X1 and X2 for a particular profit level is called a(n)

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?

Consider the following linear programming problem: The maximum possible value for the objective function is

The corner point solution method

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

If the addition of a constraint to a linear programming problem does not change the solution,the constraint is said to be

Resource restrictions are called constraints.

List the 7 properties of linear programs

Which of the following is not a property of all linear programming problems?

Define unboundedness with respect to an LP solution.

Define infeasibility with respect to an LP solution.

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

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

A straight line representing all non-negative combinations of X₁ and X₂ for a particular profit level is called a(n)