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

Competitive models, These models have been developed to establish a trade ...

These models have been developed to establish a trade off between costs of providing and the waiting time of a customer in the queuing system. Constructing a model entails desc

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

Question, A paper mill produces two grades of paper viz., X and Y. Because ...

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, 3. A paper mill produces two grades of paper viz., X an...

3. 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 pape

LPP, 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

Small sample - hypothesis testing , Small Sample The central limit ...

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

LPP, A paper mill produces two grades of paper viz., X and Y. Because of r...

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

Mba, in a rectangular game ,pay of matrix of player A is as follows

in a rectangular game ,pay of matrix of player A is as follows

Linear programming problems, 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

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