Filters
Question type

Study Flashcards

An example of a decision variable in a linear programming problem is profit maximization.

A) True
B) False

Correct Answer

verifed

verified

Use the graphical method for linear programming to find the optimal solution for the following problem. Minimize C = 12x + 4y  subject to 2x+4y125x+2y10 and x0,y0.\begin{aligned}\text { subject to } 2 x + 4 y & \geq 12 \\5 x + 2 y & \geq 10 \\\text { and } \quad x \geq 0 , y & \geq 0 .\end{aligned}


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) None of the above
G) A) and D)

Correct Answer

verifed

verified

For the products A, B, C, and D, which of the following could be a linear programming objective function?


A) P = 1A + 2B +3C + 4D
B) P = 1A + 2BC +3D
C) P = 1A + 2AB +3ABC + 4ABCD
D) P = 1A + 2B/C +3D
E) All of the answer choices are correct.

F) A) and B)
G) All of the above

Correct Answer

verifed

verified

A manager should know the following things about linear programming.


A) What it is.
B) When it should be used.
C) When it should not be used.
D) How to interpret the results of a study.
E) All of the answer choices are correct.

F) B) and C)
G) C) and E)

Correct Answer

verifed

verified

The graphical method can handle problems that involve any number of decision variables.

A) True
B) False

Correct Answer

verifed

verified

Use the graphical method for linear programming to find the optimal solution for the following problem. Minimize C = 6x + 10y subject to 2x+4y122 x + 4 y \geq 12 5x+2y10and    x0,y0.\begin{array} { l } 5 x + 2 y \geq 10 \\and~~~~x \geq 0 , y \geq 0 .\end{array}


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) A) and B)
G) A) and C)

Correct Answer

verifed

verified

D

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. The manager's goal is to maximize profits. Which of the following is not a feasible solution?


A) (D, T) = (0, 0)
B) (D, T) = (0, 250)
C) (D, T) = (150, 0)
D) (D, T) = (90, 100)
E) (D, T) = (0, 200)

F) None of the above
G) C) and D)

Correct Answer

verifed

verified

The feasible region only contains points that satisfy all constraints.

A) True
B) False

Correct Answer

verifed

verified

The operations manager for the Blue Moon Brewing Co. produces two beers: Lite (L) and Dark (D) . He can only get 675 gallons of malt extract per day for brewing and his brewing hours are limited to 8 hours per day. To produce a keg of Lite beer requires 2 minutes of time and 5 gallons of malt extract. Each keg of Dark beer needs 4 minutes of time and 3 gallons of malt extract. Profits for Lite beer are $3.00 per keg and profits for Dark beer are $2.00 per keg. The brewery's goal is to maximize profits. What is the time constraint?


A) 2L +3D ≤ 480.
B) 2L + 4D ≤ 480.
C) 3L + 2D ≤ 480.
D) 4L + 2D ≤ 480.
E) 5L + 3D ≤ 480.

F) None of the above
G) C) and D)

Correct Answer

verifed

verified

Which of the following constitutes a simultaneous solution to the following 2 equations? (1) 3x1 + 4x2 = 10 (2) 5x1 + 4x2 = 14


A) (x1, x2) = (2, 0.5)
B) (x1, x2) = (4, 0.5)
C) (x1, x2) = (2, 1)
D) x1 = x2
E) x2 = 2x1

F) B) and E)
G) C) and D)

Correct Answer

verifed

verified

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. The manager's goal is to maximize profits. What is the objective function?


A) P = 150D + 300T
B) P = 500D + 300T
C) P = 300D + 500T
D) P = 300D + 150T
E) P = 100D + 90T

F) C) and E)
G) B) and E)

Correct Answer

verifed

verified

The equation 5x + 7y = 10 is linear.

A) True
B) False

Correct Answer

verifed

verified

Use the graphical method for linear programming to find the optimal solution for the following problem. Minimize C = 3x + 15y subject to 2x+4y122 x + 4 y \geq 12               5x+2y10~~~~~~~~~~~~~~5 x + 2 y \geq 10 And x ? 0, y ? 0.


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) A) and E)
G) C) and E)

Correct Answer

verifed

verified

One of the great strengths of spreadsheets is their flexibility for dealing with a wide variety of problems.

A) True
B) False

Correct Answer

verifed

verified

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. The shop wishes to maximize profits. What is the sugar constraint?


A) 6B + 3C ≤ 4,800
B) 1B + 1C ≤ 4,800
C) 2B + 4C ≤ 4,800
D) 4B + 2C ≤ 4,800
E) 2B + 3C ≤ 4,800

F) B) and E)
G) All of the above

Correct Answer

verifed

verified

C

Using Excel's Solver add-in, find the optimal solution for the following problem? Maximize P = 8x + 3y subject to 2x+4y202 x + 4 y \leq 20 6x+3y186 x + 3 y \leq 18 andx0,y0and\quad x \geq 0 , y \geq 0


A) (x, y) = (3, 0)
B) (x, y) = (0, 3)
C) (x, y) = (0, 0)
D) (x, y) = (0, 5)
E) None of the answer choices are correct.

F) B) and C)
G) A) and D)

Correct Answer

verifed

verified

Given the following 2 constraints, which solution is a feasible solution for a maximization problem? (1) 14x1 + 6x2 ≤ 42 (2) x1 − x2 ≤ 3


A) (x1, x2) = (1, 5)
B) (x1, x2) = (5, 1)
C) (x1, x2) = (4, 4)
D) (x1, x2) = (2, 1)
E) (x1, x2) = (2, 6)

F) C) and E)
G) D) and E)

Correct Answer

verifed

verified

In linear programming, solutions that satisfy all of the constraints simultaneously are referred to as:


A) optimal.
B) feasible.
C) nonnegative.
D) targeted.
E) All of the answer choices are correct.

F) B) and E)
G) B) and D)

Correct Answer

verifed

verified

What is the time constraint?


A) 2R + 3S ≤ 720.
B) 2R + 5S ≤ 720.
C) 3R + 2S ≤ 720.
D) 3R + 5S ≤ 720.
E) 5R + 5S ≤ 720.

F) A) and B)
G) B) and D)

Correct Answer

verifed

verified

  Where are the changing cells located? A)  B2:C2 B)  B2:C2, B5:C7, and F5:F7 C)  B10:C10 D)  F10 E)  None of the answer choices are correct. Where are the changing cells located?


A) B2:C2
B) B2:C2, B5:C7, and F5:F7
C) B10:C10
D) F10
E) None of the answer choices are correct.

F) A) and B)
G) A) and C)

Correct Answer

verifed

verified

C

Showing 1 - 20 of 85

Related Exams

Show Answer