IEOPER1 Quiz 3 Flashcards
In dual simplex method, what are the questions you must ask after every iteration?
Is the solution feasible?
Does the solution follow optimality conditions?
True or False. You can use dual simplex even though the given model is primal or dual as long as there is a greater than or equal to (>=) sign in at least one of the constraints
True
You can only use dual simplex method if the first iteration or initial tableau is ________
Super optimal
if the first iteration is not super-optimal using dual simplex method, you have to _________
Add a redundant constraint wherein it is the sum of variables (qualify as EV) <= M.
Guess the characteristic of the basic solution:
Is the solution feasible? Yes
Does the solution meet optimality conditions? Yes
Optimal
Guess the characteristic of the basic solution:
Is the solution feasible? No
Does the solution meet optimality conditions? Yes
Super-optimal
Guess the characteristic of the basic solution:
Is the solution feasible? Yes
Does the solution meet optimality conditions? No
Sub-optimal
Guess the characteristic of the basic solution:
Is the solution feasible? No
Does the solution meet optimality conditions? No
Neither
In converting primal model to dual model, if the primal model is a max problem, then its constraints must be ________
<=
In converting primal model to dual model, if the primal model is a min problem, then its constraints must be ________
> =
Primal Model : xn
Dual Model: ?
Tn
Primal Model: Sn
Dual Model: ?
Yn
True or False. When the iteration of a primal problem is sub-optimal, the corresponding iteration of the dual is super-optimal.
True
True or False. If the shadow price of a resource is zero, then it follows that the corresponding slack variable is basic in the optimal tableau.
False
True or False. The number of structural constraints in the primal is the same as the number of decision variables in the dual, and the number of decision variables in the primal is the same as the number of structural constraints in the dual.
True
True or False. An unrestricted variable in the primal is converted into symmetric form by expressing it as the sum of two non-negative variables.
False
True or False. The symmetric form of a primal LP model is needed to formulate its dual model whereas the standard form is needed to begin the solution process.
False
True or False. The dual simplex method is used to solve for the new optimal solution if an objective function coefficient is changed beyond its allowable range of values.
False
True or False. A new constraint added to an existing LP model may affect the current optimal solution mix.
False
True or False. Changing the right-hand side value of a constraint will definitely change the optimal value of the objective function.
False
True or False. An equality constraint in the asymmetric form of the primal guarantees that there will also be an equality constraint in the corresponding asymmetric form of the dual.
False
True or False. If the shadow price of a resource is positive, the resource must necessarily be scarce.
True
True or False. The dual of the dual is the primal.
True
True or False. If a decision variable is non-basic in the optimal tableau, it is possible that the decision variable becomes an optimal basic decision variable if its cost per unit is increased.
False
True or False. Changing the OFC of a non-basic variable will change the current optimal value of the objective function.
False
True or False. If the primal problem has no feasible solution, then it necessarily follows that the dual will have no feasible solution.
False
True or False. In the dual simplex method, if none of the constraint coefficients associated with the leaving variable row are negative, then the LP has an unbounded solution space.
True
