Question 1

Consider the following linear programming problem.
   Find the optimal solution of the minimization problem.

Accepted Answer

Min C = 21

Question 2

Accepted Answer

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

Question 3

Graph the system of inequalities:
-

Accepted Answer

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

Question 4

Formulate the dual problem for the linear programming problem.

Accepted Answer

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

Question 5

Big Round Cheese Company has on hand 45 pounds of Cheddar and 49 pounds of Brie each day. It prepares two Christmas packages-the "Holiday"box, which has 5 pounds of Cheddar and 2 pounds of Brie, and the "Noel"box, which contains 2 pounds of Cheddar and 7 pounds of Brie. Profit on each Holiday assortment is $6, profit on each Noel assortment is $8.
(a) Give the optimal production schedule and the resulting maximum profit.
(b) How much excess Cheddar and excess Brie remain each day if this plan is followed?

Accepted Answer

(a) 7 Holiday boxes,

Question 6

Pivot once about the circled element in the simplex tableau, and read the solution from the result:
-

Accepted Answer

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

Question 7

The following chart depicts basic solutions to a system of linear inequalities. Which of the solutions is NOT feasible?

Accepted Answer

A)  (
A) , (
B) , (
C)  
B)  (
B)  and (
E)  
C)  (
B)  
D)  (
A) , (
D) , (
E) , (F) 
A)  (
A) , (
B) , (
C)  
B)  (
B)  and (
E)  
C)  (
B)  
D)  (
A) , (
D) , (
E) , (F)

Question 8

Solve the following linear programming problem by applying the simplex method to the dual problem:

Accepted Answer

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

Question 9

State whether the optimal solution has been found, an additional pivot is required, or there is no solution for the modified problem corresponding to the following simplex tableau:

Accepted Answer

There is n

Question 10

Solve the given linear programming problem using the table method:
-

Accepted Answer

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

Question 11

Write the e-system obtained via slack variables for the linear programming problem:
-

Accepted Answer

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

Question 12

Write the simplex tableau, label the columns and rows for the linear programming problem:

Accepted Answer

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

Question 13

Write the modified problem for the following linear programming problem (DO NOT SOLVE):

Accepted Answer

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

Question 14

Convert the inequality to a linear equation by adding a slack variable.

Accepted Answer

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

Question 15

Pivot once about the circled element in the simplex tableau, and read the solution from the result:
-

Accepted Answer

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

Question 16

Solve the following linear programming problem using the simplex method:

Accepted Answer

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

Question 17

Accepted Answer

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

Question 18

Formulate the dual problem for the linear programming problem:

Accepted Answer

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

Consider the following linear programming problem. Find the optimal solution of the minimization problem.

Graph the system of inequalities: -

Formulate the dual problem for the linear programming problem.

Pivot once about the circled element in the simplex tableau, and read the solution from the result: -

The following chart depicts basic solutions to a system of linear inequalities. Which of the solutions is NOT feasible?

Solve the following linear programming problem by applying the simplex method to the dual problem:

State whether the optimal solution has been found, an additional pivot is required, or there is no solution for the modified problem corresponding to the following simplex tableau:

Solve the given linear programming problem using the table method: -

Write the e-system obtained via slack variables for the linear programming problem: -

Write the simplex tableau, label the columns and rows for the linear programming problem:

Write the modified problem for the following linear programming problem (DO NOT SOLVE):

Convert the inequality to a linear equation by adding a slack variable.

Pivot once about the circled element in the simplex tableau, and read the solution from the result: -

Solve the following linear programming problem using the simplex method:

Formulate the dual problem for the linear programming problem:

Linear Equations and Graphs

Functions and Graphs

Mathematics of Finance

Systems of Linear Equations; Matrices

Linear Inequalities and Linear Programming

Logic, Sets, and Counting

Probability

Markov Chains

Data Description and Probability Distributions

Games and Decisions

Appendix A: Basic Algebra Review

Appendix B: Special Topics

Filters

Exam 6: Linear Programming: The Simplex Method

Consider the following linear programming problem. Find the optimal solution of the minimization problem.

Graph the system of inequalities: -

Formulate the dual problem for the linear programming problem.

Pivot once about the circled element in the simplex tableau, and read the solution from the result: -

The following chart depicts basic solutions to a system of linear inequalities. Which of the solutions is NOT feasible?

Solve the following linear programming problem by applying the simplex method to the dual problem:

State whether the optimal solution has been found, an additional pivot is required, or there is no solution for the modified problem corresponding to the following simplex tableau:

Solve the given linear programming problem using the table method: -

Write the e-system obtained via slack variables for the linear programming problem: -

Write the simplex tableau, label the columns and rows for the linear programming problem:

Write the modified problem for the following linear programming problem (DO NOT SOLVE):

Convert the inequality to a linear equation by adding a slack variable.

Pivot once about the circled element in the simplex tableau, and read the solution from the result: -

Solve the following linear programming problem using the simplex method:

Formulate the dual problem for the linear programming problem:

Linear Equations and Graphs

Functions and Graphs

Mathematics of Finance

Systems of Linear Equations; Matrices

Linear Inequalities and Linear Programming

Logic, Sets, and Counting

Probability

Markov Chains

Data Description and Probability Distributions

Games and Decisions

Appendix A: Basic Algebra Review

Appendix B: Special Topics

Filters