Question 1

The equation 3xy = 9 is linear.

Accepted Answer

A) True 
 B)False

Question 2

If a single optimal solution exists while using the graphical method to solve a linear programming problem,it will exist at a corner point.

Accepted Answer

A) True 
 B)False

Question 3

Which objective function has the same slope as this one: 4x + 2y = 20.

Accepted Answer

A)  2x + 4y = 20.
B)  2x - 4y = 20.
C)  4x - 2y = 20.
D)  8x + 8y = 20.
E)  4x + 2y = 10.F) A) and B)
G) C) and E)

Question 4

A feasible point on the optimal objective function line is an optimal solution.

Accepted Answer

A) True 
 B)False  True

Question 5

What is the optimal solution for the following problem?

Accepted Answer

A)  (x,y) = (0,0) .
B)  (x,y) = (0,3) .
C)  (x,y) = (0,5) .
D)  (x,y) = (1,2.5) .
E)  (x,y) = (6,0) .F) D) and E)
G) All of the above

Question 6

The production planner for a private label soft drink maker is planning the production of two soft drinks: root beer (R) and sassafras soda (S) .There are at most 12 hours per day of production time and 1500 gallons per day of carbonated water available.A case of root beer requires 2 minutes of time and 5 gallons of water to produce,while a case of sassafras soda requires 3 minutes of time and 5 gallons of water.Profits for the root beer are $6.00 per case,and profits for the sassafras soda are $4.00 per case.
-What is the objective function?

Accepted Answer

A)  P = 4R + 6S.
B)  P = 2R + 3S.
C)  P = 6R + 4S.
D)  P = 3R +2S.
E)  P = 5R + 5S.F) A) and B)
G) B) and C)

Question 7

A maximization problem can generally be characterized by having all $\ge$ constraints.

Accepted Answer

A) True 
 B)False

Question 8

A local bagel shop produces bagels (B)  and croissants (C) . Each bagel requires 6 ounces of flour, 1 gram of yeast, and 2 tablespoons of sugar. A croissant requires 3 ounces of flour, 1 gram of yeast, and 4 tablespoons of sugar. The company has 6,600 ounces of flour, 1,400 grams of yeast, and 4,800 tablespoons of sugar available for today's baking. Bagel profits are 20 cents each and croissant profits are 30 cents each.
-What is the daily profit when producing the optimal amounts?

Accepted Answer

A)  $580.
B)  $340.
C)  $220.
D)  $380.
E)  $420.F) A) and E)
G) B) and D) B

Question 9

Linear programming problems can be formulated both algebraically and on spreadsheets.

Accepted Answer

A) True 
 B)False

Question 10

What is the optimal solution for the following problem?

Accepted Answer

A)  (x,y) = (2,0) .
B)  (x,y) = (0,3) .
C)  (x,y) = (0,0) .
D)  (x,y) = (1,5) .
E)  None of the above.F) B) and D)
G) C) and E) B

Question 11

An electronics firm produces two models of pocket calculators: the A-100 (A)  and the B-200 (B) . Each model uses one circuit board, of which there are only 2,500 available for this week's production. In addition, the company has allocated a maximum of 800 hours of assembly time this week for producing these calculators. Each A-100 requires 15 minutes to produce while each B-200 requires 30 minutes to produce. The firm forecasts that it could sell a maximum of 4,000 of the A-100s this week and a maximum of 1,000 B-200s. Profits for the A-100 are $1.00 each and profits for the B-200 are $4.00 each.
-What is the weekly profit when producing the optimal amounts?

Accepted Answer

A)  $10,000.
B)  $4,600.
C)  $2,500.
D)  $5,200.
E)  $6,400.F) B) and E)
G) A) and D)

Question 12

When solving a minimization problem graphically,it is generally the goal to move the objective function line out,away from the origin,as far as possible.
Multiple Choice Questions

Accepted Answer

A) True 
 B)False

Question 13

An infeasible solution violates all of the constraints of the problem.

Accepted Answer

A) True 
 B)False

Question 14

When solving a maximization problem graphically,it is generally the goal to move the objective function line out,away from the origin,as far as possible.

Accepted Answer

A) True 
 B)False

Question 15

The operations manager of a mail order house purchases double (D)  and twin (T)  beds for resale. Each double bed costs $500 and requires 100 cubic feet of storage space. Each twin bed costs $300 and requires 90 cubic feet of storage space. The manager has $75,000 to invest in beds this week, and her warehouse has 18,000 cubic feet available for storage. Profit for each double bed is $300 and for each twin bed is $150.
-What is the storage space constraint?

Accepted Answer

A)  100D + 100T  ≤\le≤  18,000.
B)  100D + 90T  ≥\ge≥  18,000.
C)  300D + 90T  ≤\le≤  18,000.
D)  500D + 100T  ≤\le≤  18,000.
E)  100D + 90T  ≤\le≤  18,000. F) B) and D)
G) A) and C)

Question 16

A local bagel shop produces bagels (B)  and croissants (C) . Each bagel requires 6 ounces of flour, 1 gram of yeast, and 2 tablespoons of sugar. A croissant requires 3 ounces of flour, 1 gram of yeast, and 4 tablespoons of sugar. The company has 6,600 ounces of flour, 1,400 grams of yeast, and 4,800 tablespoons of sugar available for today's baking. Bagel profits are 20 cents each and croissant profits are 30 cents each.
-Which of the following is not a feasible solution?

Accepted Answer

A)  (B,
C)  = (0,0) .
B)  (B,
C)  = (0,1100) .
C)  (B,
C)  = (800,600) .
D)  (B,
C)  = (1100,0) .
E)  (B,
C)  = (0,1400) .F) B) and C)
G) C) and E)

Question 17

When formulating a linear programming problem on a spreadsheet,which of the following is true?

Accepted Answer

A)  Parameters are called data cells.
B)  Decision variables are called changing cells.
C)  Nonnegativity constraints must be included.
D)  The objective function is called the target cell.
E)  All of the above.F) All of the above
G) A) and B)

Question 18

Solving linear programming problems graphically,

Accepted Answer

A)  is possible with any number of decision variables.
B)  provides geometric intuition about what linear programming is trying to achieve.
C)  will always result in an optimal solution.
D)  All of the above.
E)  None of the above.F) A) and B)
G) A) and C)

Question 19

Linear programming models can have either $\le$ or $\ge$ inequality constraints but not both in the same problem.

Accepted Answer

A) True 
 B)False

Question 20

Given the following 2 constraints,which solution is a feasible solution for a minimization problem?
(1) ) 14x1 + 6x2  ≥\ge≥  42
(2) ) x1 + 3x2  ≥\ge≥  6

Accepted Answer

A)  (x1,x2 ) = (0.5,5) .
B)  (x1,x2 ) = (0,4) .
C)  (x1,x2 ) = (2,5) .
D)  (x1,x2 ) = (1,2) .
E)  (x1,x2 ) = (2,1) . F) A) and C)
G) C) and E)

Exam 2: Linear Programming: Basic Concepts

The equation 3xy = 9 is linear.

Correct Answer
verified

If a single optimal solution exists while using the graphical method to solve a linear programming problem,it will exist at a corner point.

Correct Answer
verified

Which objective function has the same slope as this one: 4x + 2y = 20.

Correct Answer
verified

A feasible point on the optimal objective function line is an optimal solution.

Correct Answer
verified
True

What is the optimal solution for the following problem?

Correct Answer
verified

Correct Answer
verified

A maximization problem can generally be characterized by having all $\ge$ constraints.

Correct Answer
verified

Correct Answer
verified
B

Linear programming problems can be formulated both algebraically and on spreadsheets.

Correct Answer
verified

What is the optimal solution for the following problem?

Correct Answer
verified
B

Correct Answer
verified

When solving a minimization problem graphically,it is generally the goal to move the objective function line out,away from the origin,as far as possible. Multiple Choice Questions

Correct Answer
verified

An infeasible solution violates all of the constraints of the problem.

Correct Answer
verified

When solving a maximization problem graphically,it is generally the goal to move the objective function line out,away from the origin,as far as possible.

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

When formulating a linear programming problem on a spreadsheet,which of the following is true?

Correct Answer
verified

Solving linear programming problems graphically,

Correct Answer
verified

Linear programming models can have either $\le$ or $\ge$ inequality constraints but not both in the same problem.

Correct Answer
verified

Given the following 2 constraints,which solution is a feasible solution for a minimization problem? (1) ) 14x₁ + 6x₂ $\ge$ 42 (2) ) x₁ + 3x₂ $\ge$ 6

Correct Answer
verified

Exam 2: Linear Programming: Basic Concepts

The equation 3xy = 9 is linear.

Correct AnswerverifiedShow Answer

If a single optimal solution exists while using the graphical method to solve a linear programming problem,it will exist at a corner point.

Correct AnswerverifiedShow Answer

Which objective function has the same slope as this one: 4x + 2y = 20.

Correct AnswerverifiedShow Answer

A feasible point on the optimal objective function line is an optimal solution.

Correct AnswerverifiedTrue

What is the optimal solution for the following problem?

Correct AnswerverifiedShow Answer

Correct AnswerverifiedShow Answer

A maximization problem can generally be characterized by having all ≥\ge≥ constraints.

Correct AnswerverifiedShow Answer

Correct AnswerverifiedB

Linear programming problems can be formulated both algebraically and on spreadsheets.

Correct AnswerverifiedShow Answer

What is the optimal solution for the following problem?

Correct AnswerverifiedB

Correct AnswerverifiedShow Answer

When solving a minimization problem graphically,it is generally the goal to move the objective function line out,away from the origin,as far as possible. Multiple Choice Questions

Correct AnswerverifiedShow Answer

An infeasible solution violates all of the constraints of the problem.

Correct AnswerverifiedShow Answer

When solving a maximization problem graphically,it is generally the goal to move the objective function line out,away from the origin,as far as possible.

Correct AnswerverifiedShow Answer

Correct AnswerverifiedShow Answer

Correct AnswerverifiedShow Answer

When formulating a linear programming problem on a spreadsheet,which of the following is true?

Correct AnswerverifiedShow Answer

Solving linear programming problems graphically,

Correct AnswerverifiedShow Answer

Linear programming models can have either ≤\le≤ or ≥\ge≥ inequality constraints but not both in the same problem.

Correct AnswerverifiedShow Answer

Given the following 2 constraints,which solution is a feasible solution for a minimization problem? (1) ) 14x1 + 6x2 ≥\ge≥ 42 (2) ) x1 + 3x2 ≥\ge≥ 6

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
True

Correct Answer
verified

Correct Answer
verified

A maximization problem can generally be characterized by having all $\ge$ constraints.

Correct Answer
verified

Correct Answer
verified
B

Correct Answer
verified

Correct Answer
verified
B

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Linear programming models can have either $\le$ or $\ge$ inequality constraints but not both in the same problem.

Correct Answer
verified

Given the following 2 constraints,which solution is a feasible solution for a minimization problem? (1) ) 14x₁ + 6x₂ $\ge$ 42 (2) ) x₁ + 3x₂ $\ge$ 6

Correct Answer
verified