The Dual of Linear Programming (LP)
Learn how to find the dual of a linear program.
We'll cover the following
In some cases, the dual problem of an LP problem might be easier to solve than the primal problem. If the primal is a minimization problem, the dual will be a maximization problem, and vice versa. So, depending on the specifics of the problem (simpler constraints or objective function), it might be easier to solve the dual problem than the primal problem.
Calculation of the dual objective
Consider an LP problem whose primal is given as follows:
Get hands-on with 1200+ tech skills courses.