The purpose of the ratio test is
Question 1
The purpose of the ratio test is to
|
|
1. |
Determine the slack, surplus and artificial variables |
|
|
2. |
Determine the variable to enter the next tableau |
|
|
3. |
Determine the variable to exit the next tableau |
|
|
4. |
All of the above |
|
|
5. |
None of the above |
5 points
Question 2
Refer to problem 1 on page 171 of the text. Which of the following statement is true?
|
|
1. |
There are three constraints associated with this problem |
|
|
2. |
There are three slack variables that are associated with this problem |
|
|
3. |
The initial tableau will have X1=0 and X2 = 0. |
|
|
4. |
All of the above |
|
|
5. |
None of the above |
10 points
Question 3
The objective function in linear programming usually
|
|
1. |
Specifies the rate of use of a resource by each activity |
|
|
2. |
Specifies the mathematical expression to be maximized or minimized |
|
|
3. |
Is a dimensionless quantity and is expressed without measurable units |
|
|
4. |
Is constrained to some level of attainment of the specified objective |
|
|
5. |
Is represented by a less than or equal to inequality |
5 points
Question 4
The first step in the simplex algorithm is to:
|
|
1. |
Convert the constraints of the LP to the standard form by removing the inequalities and adding slack, surplus and artificial variables |
|
|
2. |
Determine the variable to enter the next tableau by conducting a test on the Z row |
|
|
3. |
Determine the exiting variable by conducting the ratio test. |
|
|
4. |
Setting up the tableau with the objective function values and constraints |
5 points
Question 5
The simplex algorithm process uses ____________ principles to form the basis of solving for an optimal solution
|
|
1. |
Bernulli's equation |
|
|
2. |
Quadratic equations |
|
|
3. |
The method of least squares |
|
|
4. |
Gauss-Jordan Method |
10 points
Question 6
A nonbasic variable
|
|
1. |
Is determined by conducting the ratio test |
|
|
2. |
Is a nonnegative number |
|
|
3. |
has a value of zero |
|
|
4. |
All of the above |
|
|
5. |
None of the above |
10 points
Question 7
Match the simplex algorithm term to the appropriate definition
|
|
25 points
Question 8
Refer to the LP model and solution shown in figure 6 on page 242. The following statement is true:
|
|
1. |
The optimum profit is 350 |
|
|
2. |
The value for L is 25 |
|
|
3. |
One of the resources uses exactly 125 units |
|
|
4. |
All of the above |
|
|
5. |
None of the above |
10 points
Question 9
Refer to the tableau on page 215 of text (table 75). Assume that this is a tableau for a maximization problem. For the tableau to be optimal, what should the values be for c1, c2 and b
|
|
1. |
c1=-2, c2=1 and b=6 |
|
|
2. |
c1 = 4, c2 = 3, and b = 6 |
|
|
3. |
C1 = 3, C2 = 6, b = -1 |
|
|
4. |
All of the above |
|
|
5. |
None of the above |
10 points
Question 10
Which of the following is not required for all linear programming problems?
|
|
1. |
There must be an objective function to be maximized or minimized |
|
|
2. |
The variables may only assume continuous values that are greater than or equal to zero |
|
|
3. |
The constraints and objective function must be linear |
|
|
4. |
The number of constraints must be less than or equal to the number of variables |
|
|
5. |
All of the above are required |
5 points
Question 11
Which of the following is true in the standard form of a linear programming problem?
|
|
1. |
Each constraint is expressed as an equality |
|
|
2. |
There will be the same number of variables as constraints |
|
|
3. |
Redundant constraints will have to be removed |
|
|
4. |
All of the above is true |
|
|
5. |
None of the above is true |
5 points
Save and Submit
Click Save and Submit to save and submit. Click Save All Answers to save all answers.
-
-
-
-
-