1 / 6

Solving Linear Programming Problems

Solving Linear Programming Problems. The Primal-Dual Relationship Shubhagata Roy.

chase-knox
Télécharger la présentation

Solving Linear Programming Problems

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Solving Linear Programming Problems The Primal-Dual Relationship Shubhagata Roy

  2. Concept of DualityOne part of a Linear Programming Problem (LPP) is called the Primal and the other part is called the Dual. In other words, each maximization problem in LP has its corresponding problem, called the dual, which is a minimization problem. Similarly, each minimization problem has its corresponding dual, a maximization problem. For example, if the primal is concerned with maximizing the contribution from the three products A, B, and C and from the three departments X, Y, and Z, then the dual will be concerned with minimizing the costs associated with the time used in the three departments to produce those three products. An optimal solution from the primal and the dual problem would be same as they both originate from the same set of data.

  3. Rules for Constructing the Dual from Primal 1. A dual variable is defined for each constraint in the primal problem,i.e, the no. of variables in the dual problem is equal to no. of constraints in the primal problem and vice-versa. If there are m constraints and n variables in the primal problem then there would be m variables and n constraints in the dual problem. 2. The RHS of primal,i.e, b1,b2,……,bm, become the coefficients of dual variables(Y1,Y2,……,Ym) in the dual objective function(ZY). Also the coefficients of primal variables(X1,X2,……,Xn),i.e, c1,c2,……,cn, become RHS of the dual constraints. 3. For a maximization primal problem(with all < or = constraints), there exists a minimization dual problem(with all > or = constraints) and vice-versa.

  4. 4.The matrix of coefficients of variables in dual problem is the transpose of matrix of coefficients in the primal problem and vice-versa.5. If any of the primal constraint (say ith) is an equality then the corresponding dual variable is unrestricted in sign and vice-versa.The Primal-Dual Relationship

  5. Example:Maximize ZX= 6000X1+4000X2s.t. 4X1 + X2 <or= 12 9X1 + X2 <or= 20 7X1 + 3X2 <or= 18 10X1 +40X2 <or= 40X1,X2 >or= 0

  6. Hence the Dual Problem looks like,Minimize ZY = 12Y1+20Y2+18Y3+40Y4subject to the constraints,4Y1+9Y2+7Y3+10Y4 >or= 6000 Y1+ Y2+3Y3+40Y4 >or= 4000 Y1,Y2 >or= 0

More Related