Pt1420 Unit 4
Q.No. Question Options Answer 1. A negative dual price for a constraint in a minimization problem means 1. as the right-hand side increases, the objective function value will decrease. 1
2. as the right-hand side decreases, the objective function value will decrease.
3. as the right-hand side increases, the objective function value will increase.
4. as the right-hand side decreases, the objective function value will increase.
5. -
1. Which of the following is not true about slack variables in a simplex tableau? 1. They are used to convert ≤ constraint inequalities to equations. 3
2. They represent unused resources.
3. They require the addition of an artificial …show more content…
Both S1 and S2 are true.
5. -
16. A minimization problem with four decision variables, two greater-than-or-equal-to constraints, and one equality constraint will have 1. 2 surplus variables, 3 artificials, and 3 variables in the basis. 1
2. 4 surplus variables, 2 artificials, and 4 variables in the basis.
3. 3 surplus variables, 3 artificials, and 4 variables in the basis.
4. 2 surplus variables, 2 artificials, and 3 variables in the basis.
5. -
16. For obtaining the solution of dual of the following Linear Programming Problem, how many slack and/or surplus, and artificial variables are required?
Maximize profit = $50X1 + $120X2 subject to 2X1 + 4X2 ≤ 80
3X1 + 1X2 ≤ 60 1. Two slack variables 3
2. Two surplus variables
3. Two surplus variables and two artificial variables
4. One slack variable and one surplus variable
5. -
17. If the dual price for b1 is 2.7, the range of feasibility is 20 ≤ b1 ≤ 50, and the original value of b1 was 30, which of the following is true? 1. There currently is no slack in the first constraint. 4
2. We would be willing to pay up to $2.70 per unit for up to 20 more units of resource
2. as the right-hand side decreases, the objective function value will decrease.
3. as the right-hand side increases, the objective function value will increase.
4. as the right-hand side decreases, the objective function value will increase.
5. -
1. Which of the following is not true about slack variables in a simplex tableau? 1. They are used to convert ≤ constraint inequalities to equations. 3
2. They represent unused resources.
3. They require the addition of an artificial …show more content…
Both S1 and S2 are true.
5. -
16. A minimization problem with four decision variables, two greater-than-or-equal-to constraints, and one equality constraint will have 1. 2 surplus variables, 3 artificials, and 3 variables in the basis. 1
2. 4 surplus variables, 2 artificials, and 4 variables in the basis.
3. 3 surplus variables, 3 artificials, and 4 variables in the basis.
4. 2 surplus variables, 2 artificials, and 3 variables in the basis.
5. -
16. For obtaining the solution of dual of the following Linear Programming Problem, how many slack and/or surplus, and artificial variables are required?
Maximize profit = $50X1 + $120X2 subject to 2X1 + 4X2 ≤ 80
3X1 + 1X2 ≤ 60 1. Two slack variables 3
2. Two surplus variables
3. Two surplus variables and two artificial variables
4. One slack variable and one surplus variable
5. -
17. If the dual price for b1 is 2.7, the range of feasibility is 20 ≤ b1 ≤ 50, and the original value of b1 was 30, which of the following is true? 1. There currently is no slack in the first constraint. 4
2. We would be willing to pay up to $2.70 per unit for up to 20 more units of resource