Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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:
The column coefficient in the Primal constraint namely (2,2) and (3,1) have become the row coefficient in the Dual constraints.
The coefficient of the Primal objective function namely, 12 and 10 have become the constants in the right-hand-side of the Dual constraints.
The constants of the Primal constraints, namely 18 and 14, have become the coefficient in the Dual objective function.
The direction of the inequalities have been reversed. The Primal constraints have the inequalities of < while the Dual constraints have the inequalities of >.
While the Primal is a 'Maximization' problem the Dual is a 'Minimization' problem and vice versa.
Maximize p = (3)x + 2y subject to 2x + y 3x + 4y >= 12
Small Sample The central limit theorem does not work well with small samples even if the population in non Gaussian. So we cannot rely on the central limit theorem
Non-Documentary Sources: On the other hand, non-documentary sources are institutional and human resources, both of which are important links in the information-transfer chain.
An integer programming problem is identical to a linear programming problem except that one or more decision variables are constrained to take integer values. Such problems cannot
Deriving the Solution from the Model: This phase is devoted to the computation of those value of decision variables that maximize or minimize the objective function. Such
disadvantages of model in operational research
how to solve it
A company uses 4 pounds of resource 1 to make each unit of X1 and 3 pounds of resource 1 to make each unit of X2. There are only 150 pounds of resource 1 available. Which of the fo
What is meant by a mathematical model of a real situation? Discuss the importance of models in the solution of Operations research problems
Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd