DEGENERACY
Degeneracy in a linear programming problem is said to occur when a basic feasible solution contains a smaller number of non-zero variables than the number of independent constraints when values of some basic variables are zero and the Replacement ratio is same. In other words, under Simplex Method, degeneracy occurs, where there is a tie for the minimum positive replacement ratio for selecting outgoing variable. In this case, the choice for selecting outgoing variable may be made arbitrarily.
Problem 1
| Use Simplex Method to solve the following L.P. Problem. | ||
| Max. Z = 6x1 + 8x2 | ||
| Subject to: | 30 x1 + 20 x2 ≤ 300 | |
| 5x1 + 10x2 ≤ 110 | ||
| x1, x2 ≥ 0 | ||
Solution:
| Step 1→ | Formulation of LP problem after introducing slack variables: ... | |
Get Quantitative Techniques: Theory and Problems now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
