Question 1

Use the big M method to find the optimal solution to the problem.

Accepted Answer

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

Question 2

A linear programming problem has 4 decision variables,   to   ,and 8 problem constraints. How many rows are there in the table of basic solutions of the associated e-system?

Accepted Answer

A)  248 
B)  11,880 
C)  495 
D)  24 
A)  248 
B)  11,880 
C)  495 
D)  24 C

Question 3

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

Accepted Answer

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

Question 4

State the dual problem.

Accepted Answer

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

Question 5

Introduce slack variables as necessary, and write the initial simplex tableau for the problem:
-

Accepted Answer

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

Question 6

Graph the system of inequalities:
-

Accepted Answer

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

Question 7

Solve the following linear programming problem using the simplex method:

Accepted Answer

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

Question 8

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

Accepted Answer

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

Question 9

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

Accepted Answer

Min C = 17

Question 10

A catering company makes three kinds of Jello salad-orange, strawberry, and lemon. It supplies two outlet stores, Outlet A and Outlet B. The company can make up to 14 trays of orange, 20 trays of strawberry, and 24 trays of lemon per day. Outlet A needs at least 20 trays of Jello per day and Outlet B needs at least 10 trays of Jello per day. The transportation costs for shipping trays from the company to the outlets are given in the chart below:  
Type of JelloOutlet AOutlet BOrange$4$1Strawberry$1$4Lemon$5$5Formulate a linear programming problem that will determine a shipping schedule that will minimize the cost of transporting the Jello salads to fill the needs of the two outlets. DO NOT SOLVE.

Accepted Answer

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

Question 11

Refer to the table of the six basic solutions to the e-system:
-    Which of the six basic solutions are feasible? Which are not feasible? Use the basic feasible solutions to find the maximum value of

Accepted Answer

A)  Feasible: (
A) , (
B) , (
E) , (F); Not feasible: (
C) , (
D) ;
The maximum value of P is 246. 
B)  Feasible: (
A) , (
E) , (F); Not feasible: (
C) , (
D) , (
B) ;
The maximum value of P is 288. 
C)  Feasible: (
A) , (
B) , (
E) , (F); Not feasible: (
C) , (
D) ;
The maximum value of P is 126. 
D)  Feasible: (
A) , (
B) , (
E) , (F); Not feasible: (
C) , (
D) ;
The maximum value of P is 288. 
A)  Feasible: (
A) , (
B) , (
E) , (F); Not feasible: (
C) , (
D) ;
The maximum value of P is 246. 
B)  Feasible: (
A) , (
E) , (F); Not feasible: (
C) , (
D) , (
B) ;
The maximum value of P is 288. 
C)  Feasible: (
A) , (
B) , (
E) , (F); Not feasible: (
C) , (
D) ;
The maximum value of P is 126. 
D)  Feasible: (
A) , (
B) , (
E) , (F); Not feasible: (
C) , (
D) ;
The maximum value of P is 288.

Question 12

Write the simplex tableau, label the columns and rows, underline the pivot element, and identify the entering and exiting variables for the linear programming problem:

Accepted Answer

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

Question 13

For the following initial simplex tableau, identify the basic and nonbasic variables. Find the pivot element, the entering and exiting variables, and perform one pivot operation.

Accepted Answer

The answer of For the following initial simplex tableau, identify...

Question 14

Write the basic solution for the following simplex tableau:

Accepted Answer

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

Question 15

Formulate the dual problem for the linear programming problem:

Accepted Answer

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

Question 16

Convert the given i-system to an e-system using slack variables. Then construct a table of all basic solutions of the e-system. For each basic solution, indicated whether or not it is feasible:
-

Accepted Answer

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

Question 17

Formulate the dual problem for the linear programming problem:

Accepted Answer

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

Question 18

Find the initial simplex tableau for the following preliminary simplex tableau (DO NOT SOLVE):

Accepted Answer

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

Question 19

Formulate the dual problem for the linear programming problem:

Accepted Answer

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

Question 20

Write the basic solution for the following simplex tableau:

Accepted Answer

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

Use the big M method to find the optimal solution to the problem.

A linear programming problem has 4 decision variables, to ,and 8 problem constraints. How many rows are there in the table of basic solutions of the associated e-system?

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

State the dual problem.

Introduce slack variables as necessary, and write the initial simplex tableau for the problem: -

Graph the system of inequalities: -

Solve the following linear programming problem using the simplex method:

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

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

Refer to the table of the six basic solutions to the e-system: - Which of the six basic solutions are feasible? Which are not feasible? Use the basic feasible solutions to find the maximum value of

Write the simplex tableau, label the columns and rows, underline the pivot element, and identify the entering and exiting variables for the linear programming problem:

For the following initial simplex tableau, identify the basic and nonbasic variables. Find the pivot element, the entering and exiting variables, and perform one pivot operation.

Write the basic solution for the following simplex tableau:

Formulate the dual problem for the linear programming problem:

Convert the given i-system to an e-system using slack variables. Then construct a table of all basic solutions of the e-system. For each basic solution, indicated whether or not it is feasible: -

Formulate the dual problem for the linear programming problem:

Find the initial simplex tableau for the following preliminary simplex tableau (DO NOT SOLVE):

Formulate the dual problem for the linear programming problem:

Write the basic solution for the following simplex tableau:

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

Use the big M method to find the optimal solution to the problem.

A linear programming problem has 4 decision variables, to ,and 8 problem constraints. How many rows are there in the table of basic solutions of the associated e-system?

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

State the dual problem.

Introduce slack variables as necessary, and write the initial simplex tableau for the problem: -

Graph the system of inequalities: -

Solve the following linear programming problem using the simplex method:

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

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

Refer to the table of the six basic solutions to the e-system: - Which of the six basic solutions are feasible? Which are not feasible? Use the basic feasible solutions to find the maximum value of

Write the simplex tableau, label the columns and rows, underline the pivot element, and identify the entering and exiting variables for the linear programming problem:

For the following initial simplex tableau, identify the basic and nonbasic variables. Find the pivot element, the entering and exiting variables, and perform one pivot operation.

Write the basic solution for the following simplex tableau:

Formulate the dual problem for the linear programming problem:

Convert the given i-system to an e-system using slack variables. Then construct a table of all basic solutions of the e-system. For each basic solution, indicated whether or not it is feasible: -

Formulate the dual problem for the linear programming problem:

Find the initial simplex tableau for the following preliminary simplex tableau (DO NOT SOLVE):

Formulate the dual problem for the linear programming problem:

Write the basic solution for the following simplex tableau:

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