A basic feasible solution is called degenerate when which condition occurs?
Correct answer: A. At least one basic variable has a zero value
- A. At least one basic variable has a zero value
- B. Every decision variable has a positive value
- C. The objective function has no coefficients
- D. The feasible region has no boundary
Explanation
Degeneracy occurs when one or more basic variables are zero in a basic feasible solution. It can cause more constraints to meet at a corner than are required to define that corner.
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
In a graphical solution of a two-variable linear programming problem, what does the common area satisfying all constraints represent?
If the primal linear programming problem is a maximization problem with less-than-or-equal constraints and non-negative variables, what is the usual form of its dual?
Which assumption of linear programming means that the contribution of each activity is directly proportional to its level?
In linear programming, how is a constraint such as 3x + 2y ≥ 10 usually converted into an equality?
A constraint is binding at a particular solution when it:
Which feature indicates that a maximization linear programming problem is unbounded?