In the simplex method for a maximization problem, which variable usually enters the basis?
Correct answer: D. The variable with the most positive reduced cost
- A. The variable with the largest basic value
- B. The variable with the smallest right-hand side
- C. The variable with the least positive coefficient
- D. The variable with the most positive reduced cost
Explanation
For the usual maximization tableau, the entering variable is selected from the column with the most positive improving coefficient. The leaving variable is then determined separately by the minimum ratio test.
Report an error
The more specific you are, the faster it gets fixed. A source beats an opinion.
Prefer email? [email protected]
About Linear Programming
Linear programming models the maximum or minimum of an objective function subject to linear constraints. Questions involve translating word conditions into inequalities, drawing the feasible region, identifying corner points and evaluating the objective function, including cases involving non-negativity restrictions and redundant constraints.
Practise Linear Programming
30 free Linear Programming MCQs from Quantitative Methods, each with the correct answer and an explanation. Unlimited attempts, no account needed.
Discussion
Stuck on an option, or know a faster way to get there? Ask or explain it here.
No comments yet. Be the first to explain this one.
Exams that ask Quantitative Methods questions like this
Quantitative Methods is on this paper prepared for on TestUstad, and all of them draw the same bank, so this question is worth knowing for it.
More Linear Programming questions
For a constraint of the form 4x + 3y ≥ 12, which variable is normally subtracted to obtain an equality?
What is the main purpose of introducing an artificial variable in the simplex method?
Which assumption of linear programming allows decision variables to take fractional values?
Which statement best distinguishes a feasible solution from a basic feasible solution?
If a primal maximization problem and its dual minimization problem are both feasible, which relationship must hold for any feasible pair of solutions?
In sensitivity analysis, what does the allowable increase of an objective coefficient indicate?