It is a variation of the Simplex method where the dual problem of the original linear programming problem is solved. It is useful for problems where the number of constraints is much larger than the number of decision variables.
It is a variation of the Simplex method where the dual problem of the original linear programming problem is solved. It is useful for problems where the number of constraints is much larger than the number of decision variables.