Duality, Operation Research

Assignment Help:

For every LP formulation there exists another unique linear programming formulation called the 'Dual' (the original formulation is called the 'Primal'). Same data can be used for both 'Dual' and 'Primal' formulation.  Both can be solved in a similar manner as the Dual is also an LP formulation.

The Dual can be considered as the 'inverse' of the Primal in every respect. The column coefficients in the Primal constraints become the row co-efficients in the Dual constraints. The coefficients in the Primal objective function become the right-hand-side constraints in the Dual constraints. The column of constants on the right hand side of the Primal constraints becomes the row of coefficients of the dual objective function. The direction of the inequalities are reversed. If the primal objective function is a 'Maximization' function then the dual objective function is a 'Minimization' function and vice versa.

 Example 

Consider the following 'Primal' LP formulation.

Maximize   12x1 + 10x2

subject to         2x1 +   3x2  <  18

                       2x1 +    x2   <  14

                             x1, x2   >    0

The 'Dual' formulation for this problem would be

Minimize      18y1 + 14y2

subject to   2y1 +   2y2    > 12

                   3y1 + y2    > 10

                   y1 > 0,  y2  >  0

Note the following:

  1. The column coefficient in the Primal constraint namely (2,2) and (3,1) have become the row coefficient in the Dual constraints.

  2. The coefficient of the Primal objective function namely, 12 and 10 have become the constants in the right-hand-side of the Dual constraints.

  3. The constants of the Primal constraints, namely 18 and 14, have become the coefficient in the Dual objective function.

  4. The direction of the inequalities have been reversed. The Primal constraints have the inequalities of < while the Dual constraints have the inequalities of >.

  5. While the Primal is a 'Maximization' problem the Dual is a 'Minimization' problem and vice versa.              


Related Discussions:- Duality

Linear programing, Maximize6x1+8x2+5x3,st,labour3x1+4x2+5x3 =0 then brefly ...

Maximize6x1+8x2+5x3,st,labour3x1+4x2+5x3 =0 then brefly explain x1,x2,x3;term labour,metal&plastic;the160hours;x1,x2&x3>=0

Dynamic programming models, Dynamic programming may be considered thoutgr...

Dynamic programming may be considered thoutgrowth of mathematical programming and involves the optimization of multistage( sequence of inter related decisions) decision process

Modi method, find optimal solution for a 3*4 matrix 42 27 24 35 46 37 32 3...

find optimal solution for a 3*4 matrix 42 27 24 35 46 37 32 32 40 40 30 35 using modi method

Solve the following lpp by graphical method, A company manufactures two typ...

A company manufactures two types of printed circuits. The requirements of transistors, resistors and capacitor for each type of printed circuits along with other data are given in

Duality, For every LP formulation there exists another unique linear ...

For every LP formulation there exists another unique linear programming formulation called the 'Dual' (the original formulation is called the 'Primal'). Same data

Linear programming, B A paper mill produces two grades of paper viz., X and...

B A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper

Llp, Solve the following Linear Programming Problem using Simple method. Ma...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Reasearch on software design, Write a research paper in relation to a Softw...

Write a research paper in relation to a Software Design related topic. Diagrams and drawing of attention to key points through highlighting, bulleting etc is encouraged. Questi

Linear Programming Problem, A paper mill produces two grades of paper viz.,...

A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper i

Linear programming, Meaning of Linear programming problem and explanation o...

Meaning of Linear programming problem and explanation of graphical method of solving Linear Programming Problem

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd