Question 1

Given below is the sketch of the feasible region in a linear programming problem. Which point is NOT in the feasible region?

Accepted Answer

A)  (0, 4) 
B)  (4, 0) 
C)  (6, 0) 
D)  (1, 2) 
A)  (0, 4) 
B)  (4, 0) 
C)  (6, 0) 
D)  (1, 2)

Question 2

Find the graph of the inequality 3x + 4y F1F1F1S1F1F1F10 12.

Accepted Answer

A) 
  
B) 
  
C) 
  
D) 
  
A) 
  
B) 
  
C) 
  
D)

Question 3

Explain why the feasible region for a linear programming mixture problem must be in the first quadrant of the Cartesian plane.

Accepted Answer

In a linear programming mixture problem,

Question 4

Find the point of intersection for the lines represented by the equations 3x + 2y = 16 and 4x + 3y = 23.

Accepted Answer

The answer of Find the point of intersection for the...

Question 5

Use the following to answer the Questions:
concern the following tableau for a shipping problem.  
-What is the indicator value of cell (III, 1)?

Accepted Answer

The answer of Use the following to answer the Questions:
concern...

Question 6

Find the graph of the equation 4x + 6y = 18.

Accepted Answer

A) 
  
B) 
  
C) 
  
D) 
  
A) 
  
B) 
  
C) 
  
D)

Question 7

The simplex algorithm always gives optimal solutions to linear programming problems.

Accepted Answer

A) True 
 B)False

Question 8

The graph of the feasible region for a mixture problem is shown below. Find the point that maximizes the profit function P = 3x + 6y.

Accepted Answer

A)  (0, 4) 
B)  (3, 3) 
C)  (5, 1) 
D)  (6, 0) 
A)  (0, 4) 
B)  (3, 3) 
C)  (5, 1) 
D)  (6, 0)

Question 9

Given below is the sketch of the feasible region in a linear programming problem. Which point is NOT in the feasible region?

Accepted Answer

A)  (0, 6) 
B)  (4, 0) 
C)  (4, 2) 
D)  (6, 0) 
A)  (0, 6) 
B)  (4, 0) 
C)  (4, 2) 
D)  (6, 0)

Question 10

Solve this linear programming mixture problem: A small stereo manufacturer makes a receiver and a CD player. Each receiver takes eight hours to assemble, one hour to test and ship, and earns a profit of $30. Each CD player takes 15 hours to assemble, two hours to test and ship, and earns a profit of $50. There are 160 hours available in the assembly department and 26 hours available in the testing and shipping department. What should the production schedule be to maximize profit?

Accepted Answer

x is the number of receivers and y is th

Question 11

Find the point of intersection of the lines with equations 2x + 5y = 6 and 3x + 2y = 9.

Accepted Answer

A)  (3, 0) 
B)  (2, 1) 
C)  (-3, 0) 
D)  (1, 2) 
A)  (3, 0) 
B)  (2, 1) 
C)  (-3, 0) 
D)  (1, 2)

Question 12

Consider the feasible region identified by the inequalities below. x F1F1F1S1F1F1F10 0; y F1F1F1S1F1F1F10 0; x + y F1F1F1S1F1F1F10 4; x + 3y F1F1F1S1F1F1F10 6 Which point is NOT a corner of the region?

Accepted Answer

A)  (0, 2) 
B)  (0, 4) 
C)  (3, 1) 
D)  (4, 0) 
A)  (0, 2) 
B)  (0, 4) 
C)  (3, 1) 
D)  (4, 0)

Question 13

Explain what the real world implications are if the optimal production policy for a linear programming mixture problem is represented by a point on the x-axis of the Cartesian plane.

Accepted Answer

If the optimal production policy for a l

Question 14

With the given constraints for the following linear programming mixture problem, graph the feasible region.  
2 x + 3y F1F1F1S1F1F1F10 1800
x F1F1F1S1F1F1F10 0
y F1F1F1S1F1F1F10 0

Accepted Answer

The answer of With the given constraints for the following...

Question 15

Use the following tableau to answer the questions:
concern the following tableau for a shipping problem.  
-In the tableau produced by the Northwest Corner Rule, what is the indicator value of cell (I, 2)?

Accepted Answer

A)  $- 10$ 
B)  $- 7$ 
C)  5 
D)  8 
A)  $- 10$ 
B)  $- 7$ 
C)  5 
D)  8

Question 16

Graph the constraint inequalities for a linear programming problem shown below. Which feasible region shown is correct? $$\begin{array} { l } 
6 x + 4 y \leq 12 \
x \geq 0 , y \geq 0
\end{array}$$

Accepted Answer

A) 
  
B) 
  
C) 
  
D) 
  
A) 
  
B) 
  
C) 
  
D)

Question 17

Graph the constraint inequalities for a linear programming problem shown below. Which feasible region shown is correct? $$\begin{array} { l } 
4 x + 3 y \leq 24 \
x \geq 0 , y \geq 0
\end{array}$$

Accepted Answer

A) 
  
B) 
  
C) 
  
D) 
  
A) 
  
B) 
  
C) 
  
D)

Question 18

Write the constraint inequalities for this situation: Kim and Lynn produce pottery vases and bowls. A vase requires 35 oz of clay and 5 oz of glaze. A bowl requires 20 oz of clay and 10 oz of glaze. There are 500 oz of clay available and 200 oz of glaze available. The profit on one vase is $5 and the profit on one bowl is $4.

Accepted Answer

A)  35x + 5y F1F1F1S1F1F1F10 5, 20 x + 10y F1F1F1S1F1F1F10 4, x F1F1F1S1F1F1F10 0, y F1F1F1S1F1F1F10 0 
B)  35x + 5y F1F1F1S1F1F1F10 500, 20 x + 10y F1F1F1S1F1F1F10 200, x F1F1F1S1F1F1F10 0, y F1F1F1S1F1F1F10 0 
C)  35x + 20y F1F1F1S1F1F1F10 500, 5 x + 10y F1F1F1S1F1F1F10 200, x F1F1F1S1F1F1F10 0, y F1F1F1S1F1F1F10 0 
D)  35x + 20y F1F1F1S1F1F1F10 $5, 5 x + 10y F1F1F1S1F1F1F10 $4, x F1F1F1S1F1F1F10 0, y F1F1F1S1F1F1F10 0 
A)  35x + 5y F1F1F1S1F1F1F10 5, 20 x + 10y F1F1F1S1F1F1F10 4, x F1F1F1S1F1F1F10 0, y F1F1F1S1F1F1F10 0 
B)  35x + 5y F1F1F1S1F1F1F10 500, 20 x + 10y F1F1F1S1F1F1F10 200, x F1F1F1S1F1F1F10 0, y F1F1F1S1F1F1F10 0 
C)  35x + 20y F1F1F1S1F1F1F10 500, 5 x + 10y F1F1F1S1F1F1F10 200, x F1F1F1S1F1F1F10 0, y F1F1F1S1F1F1F10 0 
D)  35x + 20y F1F1F1S1F1F1F10 $5, 5 x + 10y F1F1F1S1F1F1F10 $4, x F1F1F1S1F1F1F10 0, y F1F1F1S1F1F1F10 0

Question 19

Find the point of intersection of the lines with equations 4x + 2y = 12 and 3x + 9y = 39.

Accepted Answer

A)  (5, -4) 
B)  (10, 1) 
C)  (1, 4) 
D)  (2, 2) 
A)  (5, -4) 
B)  (10, 1) 
C)  (1, 4) 
D)  (2, 2)

Question 20

What is the goal of a linear programming?

Accepted Answer

To minimize or maxim

Exam 4: Linear Programming

Given below is the sketch of the feasible region in a linear programming problem. Which point is NOT in the feasible region?

Find the graph of the inequality 3x + 4y  12.

Explain why the feasible region for a linear programming mixture problem must be in the first quadrant of the Cartesian plane.

Find the point of intersection for the lines represented by the equations 3x + 2y = 16 and 4x + 3y = 23.

Use the following to answer the Questions: concern the following tableau for a shipping problem. -What is the indicator value of cell (III, 1)?

Find the graph of the equation 4x + 6y = 18.

The simplex algorithm always gives optimal solutions to linear programming problems.

The graph of the feasible region for a mixture problem is shown below. Find the point that maximizes the profit function P = 3x + 6y.

Given below is the sketch of the feasible region in a linear programming problem. Which point is NOT in the feasible region?

Find the point of intersection of the lines with equations 2x + 5y = 6 and 3x + 2y = 9.

Consider the feasible region identified by the inequalities below. x  0; y  0; x + y  4; x + 3y  6 Which point is NOT a corner of the region?

Explain what the real world implications are if the optimal production policy for a linear programming mixture problem is represented by a point on the x-axis of the Cartesian plane.

With the given constraints for the following linear programming mixture problem, graph the feasible region. 2 x + 3y  1800 x  0 y  0

Use the following tableau to answer the questions: concern the following tableau for a shipping problem. -In the tableau produced by the Northwest Corner Rule, what is the indicator value of cell (I, 2)?

Graph the constraint inequalities for a linear programming problem shown below. Which feasible region shown is correct? 6x+4y\leq12 x\geq0,y\geq0

Graph the constraint inequalities for a linear programming problem shown below. Which feasible region shown is correct? 4x+3y\leq24 x\geq0,y\geq0

Find the point of intersection of the lines with equations 4x + 2y = 12 and 3x + 9y = 39.

What is the goal of a linear programming?

Urban Services

Business Efficiency

Planning and Scheduling

Exploring Data: Distributions

Exploring Data: Relationships

Data for Decisions

Probability: the Mathematics of Chance

Social Choice: the Impossible Dream

The Manipulability of Voting Systems

Weighted Voting Systems

Electing the President

Fair Division

Apportionment

Game Theory: the Mathematics of Competition

Identification Numbers

Information Science

Growth and Form

Symmetry and Patterns

Tilings

Savings Models

Borrowing Models

The Economics of Resources

Filters