Question 1

No matter what value it has,each objective function line is parallel to every other objective function line in a problem.

Accepted Answer

A) True 
 B)False

Question 2

Slack

Accepted Answer

A) is the difference between the left and right sides of a constraint. 
B) is the amount by which the left side of a  constraint is larger than the right side. 
D) exists for each variable in a linear programming problem.

Question 3

A constraint that does not affect the feasible region is a

Accepted Answer

A) non-negativity constraint. 
B) redundant constraint. 
C) standard constraint. 
D) slack constraint.

Question 4

A redundant constraint is a binding constraint.

Accepted Answer

A) True 
 B)False

Question 5

Solve the following system of simultaneous equations.
6X + 4Y = 40
2X + 3Y = 20

Accepted Answer

The answer of Solve the following system of simultaneous equations.
6X...

Question 6

Increasing the right-hand side of a nonbinding constraint will not cause a change in the optimal solution.

Accepted Answer

A) True 
 B)False

Question 7

The standard form of a linear programming problem will have the same solution as the original problem.

Accepted Answer

A) True 
 B)False

Question 8

Decision variables limit the degree to which the objective in a linear programming problem is satisfied.

Accepted Answer

A) True 
 B)False

Question 9

Maxwell Manufacturing makes two models of felt tip marking pens.Requirements for each lot of pens are given below.
  The profit for either model is $1000 per lot. 
a.What is the linear programming model for this problem?
b.Find the optimal solution.
c.Will there be excess capacity in any resource?

Accepted Answer

The answer of Maxwell Manufacturing makes two models of felt...

Question 10

Only binding constraints form the shape (boundaries)of the feasible region.

Accepted Answer

A) True 
 B)False

Question 11

The constraint 5x1 - 2x2 < 0 passes through the point (20,50).

Accepted Answer

A) True 
 B)False

Question 12

Decision variables

Accepted Answer

A) tell how much or how many of something to produce,invest,purchase,hire,etc. 
B) represent the values of the constraints. 
C) measure the objective function. 
D) must exist for each constraint.

Question 13

All linear programming problems have all of the following properties EXCEPT

Accepted Answer

A) a linear objective function that is to be maximized or minimized. 
B) a set of linear constraints. 
C) alternative optimal solutions. 
D) variables that are all restricted to nonnegative values.

Question 14

Which of the following is a valid objective function for a linear programming problem?

Accepted Answer

A) Max 5xy 
B) Min 4x + 3y + (2/3)z 
C) Max 5x2  + 6y2 
D) Min (x1 + x2)/x3

Question 15

Which of the following special cases does not require reformulation of the problem in order to obtain a solution?

Accepted Answer

A) alternate optimality 
B) infeasibility 
C) unboundedness 
D) each case requires a reformulation.

Question 16

Muir Manufacturing produces two popular grades of commercial carpeting among its many other products.In the coming production period,Muir needs to decide how many rolls of each grade should be produced in order to maximize profit.Each roll of Grade X carpet uses 50 units of synthetic fiber,requires 25 hours of production time,and needs 20 units of foam backing.Each roll of Grade Y carpet uses 40 units of synthetic fiber,requires 28 hours of production time,and needs 15 units of foam backing.
The profit per roll of Grade X carpet is $200 and the profit per roll of Grade Y carpet is $160.In the coming production period,Muir has 3000 units of synthetic fiber available for use.Workers have been scheduled to provide at least 1800 hours of production time (overtime is a possibility).The company has 1500 units of foam backing available for use.
Develop and solve a linear programming model for this problem.

Accepted Answer

The answer of Muir Manufacturing produces two popular grades of...

Question 17

For the following linear programming problem,determine the optimal solution by the graphical solution method.Are any of the constraints redundant? If yes,then identify the constraint that is redundant. Max X + 2Y s.t.X + Y < 3 X - 2Y > 0 Y < 1 X,Y $\ge$ 0

Accepted Answer

The answer of For the following linear programming problem,determine the...

Question 18

In a feasible problem,an equal-to constraint cannot be nonbinding.

Accepted Answer

A) True 
 B)False

Question 19

To find the optimal solution to a linear programming problem using the graphical method

Accepted Answer

A) find the feasible point that is the farthest away from the origin. 
B) find the feasible point that is at the highest location. 
C) find the feasible point that is closest to the origin. 
D) None of the alternatives is correct.

Question 20

A linear programming problem can be both unbounded and infeasible.

Accepted Answer

A) True 
 B)False

Exam 7: Introduction to Linear Programming

No matter what value it has,each objective function line is parallel to every other objective function line in a problem.

Slack

A constraint that does not affect the feasible region is a

A redundant constraint is a binding constraint.

Solve the following system of simultaneous equations. 6X + 4Y = 40 2X + 3Y = 20

Increasing the right-hand side of a nonbinding constraint will not cause a change in the optimal solution.

The standard form of a linear programming problem will have the same solution as the original problem.

Decision variables limit the degree to which the objective in a linear programming problem is satisfied.

Maxwell Manufacturing makes two models of felt tip marking pens.Requirements for each lot of pens are given below. The profit for either model is $1000 per lot. a.What is the linear programming model for this problem? b.Find the optimal solution. c.Will there be excess capacity in any resource?

Only binding constraints form the shape (boundaries)of the feasible region.

The constraint 5x₁ - 2x₂ < 0 passes through the point (20,50).

Decision variables

All linear programming problems have all of the following properties EXCEPT

Which of the following is a valid objective function for a linear programming problem?

Which of the following special cases does not require reformulation of the problem in order to obtain a solution?

For the following linear programming problem,determine the optimal solution by the graphical solution method.Are any of the constraints redundant? If yes,then identify the constraint that is redundant. Max X + 2Y s.t.X + Y < 3 X - 2Y > 0 Y < 1 X,Y $\ge$ 0

In a feasible problem,an equal-to constraint cannot be nonbinding.

To find the optimal solution to a linear programming problem using the graphical method

A linear programming problem can be both unbounded and infeasible.

Exam 7: Introduction to Linear Programming

No matter what value it has,each objective function line is parallel to every other objective function line in a problem.

Slack

A constraint that does not affect the feasible region is a

A redundant constraint is a binding constraint.

Solve the following system of simultaneous equations. 6X + 4Y = 40 2X + 3Y = 20

Increasing the right-hand side of a nonbinding constraint will not cause a change in the optimal solution.

The standard form of a linear programming problem will have the same solution as the original problem.

Decision variables limit the degree to which the objective in a linear programming problem is satisfied.

Maxwell Manufacturing makes two models of felt tip marking pens.Requirements for each lot of pens are given below. The profit for either model is $1000 per lot. a.What is the linear programming model for this problem? b.Find the optimal solution. c.Will there be excess capacity in any resource?

Only binding constraints form the shape (boundaries)of the feasible region.

The constraint 5x1 - 2x2 < 0 passes through the point (20,50).

Decision variables

All linear programming problems have all of the following properties EXCEPT

Which of the following is a valid objective function for a linear programming problem?

Which of the following special cases does not require reformulation of the problem in order to obtain a solution?

For the following linear programming problem,determine the optimal solution by the graphical solution method.Are any of the constraints redundant? If yes,then identify the constraint that is redundant. Max X + 2Y s.t.X + Y < 3 X - 2Y > 0 Y < 1 X,Y ≥\ge≥ 0

In a feasible problem,an equal-to constraint cannot be nonbinding.

To find the optimal solution to a linear programming problem using the graphical method

A linear programming problem can be both unbounded and infeasible.

The constraint 5x₁ - 2x₂ < 0 passes through the point (20,50).

For the following linear programming problem,determine the optimal solution by the graphical solution method.Are any of the constraints redundant? If yes,then identify the constraint that is redundant. Max X + 2Y s.t.X + Y < 3 X - 2Y > 0 Y < 1 X,Y $\ge$ 0