Question 1

Which of the following is not a feasible production combination?

Accepted Answer

A) 0 D & 0 C 
B) 0 D & 1,000 C 
C) 800 D & 600 C 
D) 1,600 D & 0 C 
E) 0 D & 1,200 C

Question 2

An example of a decision variable in an LP problem is profit maximization.

Accepted Answer

A) True 
 B)False

Question 3

Which of the following could not be a linear programming problem constraint?

Accepted Answer

A) 1A + 2B $\le$ 3 
B) 1A + 2B $\ge$ 3 
C) 1A + 2B = 3 
D) 1A + 2B + 3C + 4D $\le$ 5 
E) 1 A + 2B

Question 4

Given this problem:

Accepted Answer

The answer of Given this problem: ...

Question 5

Consider the linear programming problem below:  Determine the optimum amounts of x and y in terms of cost minimization.What is the minimum cost?

Accepted Answer

The answer of Consider the linear programming problem below: ...

Question 6

What is the objective function?

Accepted Answer

A) $0.30 B + $0.20 C = Z 
B) $0.60 B + $0.30 C = Z 
C) $0.20 B + $0.30 C = Z 
D) $0.20 B + $0.40 C = Z 
E) $0.10 B + $0.10 C = Z

Question 7

Which of the choices below constitutes a simultaneous solution to these equations?

Accepted Answer

A) x = 2, y = .5 
B) x = 4, y = -.5 
C) x = 2, y = 1 
D) x = y 
E) y = 2x

Question 8

Non-binding constraints are not associated with the feasible solution space; i.e., they are redundant and can be eliminated from the matrix.

Accepted Answer

A) True 
 B)False

Question 9

What is the constraint for resource III?

Accepted Answer

The answer of What is the constraint for resource III?...

Question 10

The term "range of optimality" refers to a constraint's right-hand side quantity.

Accepted Answer

A) True 
 B)False

Question 11

The feasible solution space only contains points that satisfy all constraints.

Accepted Answer

A) True 
 B)False

Question 12

Wood Specialties Company produces wall shelves, bookends, and shadow boxes.It is necessary to plan the production schedule for next week.The wall shelves, bookends, and shadow boxes are made of oak, of which the company has 600 board feet.A wall shelf requires 4 board feet, bookends require 2 board feet, and a shadow box requires 3 board feet.The company has a power saw for cutting the oak boards into the appropriate pieces; a wall shelf requires 30 minutes, bookends require 15 minutes, and a shadow box requires 15 minutes.The power saw is expected to be available for 36 hours next week.After cutting, the pieces of work in process are hand finished in the finishing department, which consists of 4 skilled and experienced craftsmen, each of whom can complete any of the products.A wall shelf requires 60 minutes of finishing, bookends require 30 minutes, and a shadow box requires 90 minutes.The finishing department is expected to operate for 40 hours next week.Wall shelves sell for $29.95 and have a unit variable cost of $17.95; bookends sell for $11.95 and have a unit variable cost of $4.95; a shadow box sells for $16.95 and has a unit variable cost of $8.95.
(A) Is this a problem in maximization or minimization?
(B) What are the decision variables? Suggest symbols for them.
(C) What is the objective function?
(D) What are the constraints?

Accepted Answer

The answer of Wood Specialties Company produces wall shelves, bookends,...

Question 13

Graphical linear programming can handle problems that involve any number of decision variables.

Accepted Answer

A) True 
 B)False

Question 14

The logical approach, from beginning to end, for assembling a linear programming model begins with:

Accepted Answer

A) identifying the decision variables 
B) identifying the objective function 
C) specifying the objective function parameters 
D) identifying the constraints 
E) specifying the constraint parameters

Question 15

The region which satisfies all of the constraints in graphical linear programming is called the:

Accepted Answer

A) optimum solution space 
B) region of optimality 
C) lower left hand quadrant 
D) region of non-negativity 
E) feasible solution space

Question 16

What is the time constraint?

Accepted Answer

A) 2 L + 3 D $\le$ 480 
B) 2 L + 4 D $\le$ 480 
C) 3 L + 2 D $\le$ 480 
D) 4 L + 2 D $\le$ 480 
E) 5 L + 3 D $\le$ 480

Question 17

Linear programming techniques will always produce an optimal solution to an LP problem.

Accepted Answer

A) True 
 B)False

Question 18

The theoretical limit on the number of constraints that can be handled by the simplex method in a single problem is:

Accepted Answer

A) 1 
B) 2 
C) 3 
D) 4 
E) unlimited

Question 19

What is the Dominican bean constraint?

Accepted Answer

A) 12A + 8B $\le$ 4,800 
B) 8A + 12B $\le$ 4,800 
C) 4A + 8B $\le$ 3,200 
D) 8A + 4B $\le$ 3,200 
E) 4A + 8B $\le$ 4,800

Question 20

The simplex method is a general-purpose LP algorithm that can be used for solving only problems with more than six variables.

Accepted Answer

A) True 
 B)False

Exam 19: Linear Programming

Which of the following is not a feasible production combination?

An example of a decision variable in an LP problem is profit maximization.

Which of the following could not be a linear programming problem constraint?

Given this problem:

Consider the linear programming problem below: Determine the optimum amounts of x and y in terms of cost minimization.What is the minimum cost?

What is the objective function?

Which of the choices below constitutes a simultaneous solution to these equations?

Non-binding constraints are not associated with the feasible solution space; i.e., they are redundant and can be eliminated from the matrix.

What is the constraint for resource III?

The term "range of optimality" refers to a constraint's right-hand side quantity.

The feasible solution space only contains points that satisfy all constraints.

Graphical linear programming can handle problems that involve any number of decision variables.

The logical approach, from beginning to end, for assembling a linear programming model begins with:

The region which satisfies all of the constraints in graphical linear programming is called the:

What is the time constraint?

Linear programming techniques will always produce an optimal solution to an LP problem.

The theoretical limit on the number of constraints that can be handled by the simplex method in a single problem is:

What is the Dominican bean constraint?

The simplex method is a general-purpose LP algorithm that can be used for solving only problems with more than six variables.