Linear programming solution by steps for two-phase method, Operation Research

Assignment Help:

Solve by Steps for Two-Phase Method

Max Z = 5x1 + 8x2

Subject to

3x1 + 2x2 ≥ 3

x1 + 4x2 ≥ 4

x1 + x2 ≤ 5

    &     x1 ≥ 0, x≥ 0

Answer

Standard LPP

 

Max Z = 5x1 + 8x2  

    Subject to

                        3x1 + 2x2 - s1+ a1 = 3

                        x1 + 4x2 - s2+ a2  = 4

                        x1 + x2 + s3 = 5

                        x1 , x2 , s1, s2, s3, a1, a≥ 0

 

Auxiliary LPP

Max Z* = 0x1 + 0x2 + 0s1 + 0s2 + 0s3 -1a1 -1a2

    Subject to

                        3x1 + 2x2 - s1+ a1 = 3

                        x1 + 4x2 - s2+ a2  = 4

                        x1 + x2 + s3 = 5

                        x1 , x2 , s1, s2, s3, a1, a≥ 0

1377_two-steps-method-LPP.png

 

As all Δj ≥ 0, Max Z* = 0 and no artificial vector appears in the basis, we move to phase II. 

Phase II

266_phase-II.png

As all Δj ≥ 0, optimal basic feasible solution is achieved. Thus the solution is Max Z = 40, x1 = 0, x2 = 5


Related Discussions:- Linear programming solution by steps for two-phase method

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 Programing, A paper mill produces two grades of paper viz., X and Y....

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

Fromulation of LPP, A paper mill produces two grades of paper viz., X and ...

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 ot grade Y paper in

Decision theory, the following table gives place under different states of ...

the following table gives place under different states of nature Strategies States of nature s1 s2 s3 A 10000 3000 2000 B

Sampling techniques, discuss and explain both probability and non probabili...

discuss and explain both probability and non probability sampling techniques.

Simplex method, Solve the following Linear Programming Problem using Simple...

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

Histogram and historigram, #qudistinguish between histogram and historigram...

#qudistinguish between histogram and historigram estion..

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