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

Institutional Characteristics - information resources, Institutional Charac...

Institutional Characteristics:  An approach to an understanding of the fields of interest of individuals to be served and of the organisation as a whole could begin by acquiri

Least cost method of transportation model, how do you calculate using this ...

how do you calculate using this method where the least cost appears twice

Two handed process chart of signing a latter, Two Handed process Chart of S...

Two Handed process Chart of Signing a Latter     A multiple  activity  chart  records the related  sequence of activities  of more  than one subject, men  and / or  machine  o

First paper, discuss the seauencing decision problem for n jobs on two and ...

discuss the seauencing decision problem for n jobs on two and three machines

Vogel approximation methods, This method is more  systematic and orderly th...

This method is more  systematic and orderly than least cost method. Here penalties for each column and row of the transportation table are determined, and the row  or  column with

Solved a.q, Solve the following Linear Programming Problem using Simple met...

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

PROBLEM , #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

Binomial distriubiton - probability distribution , BINOMIAL DISTRIUBITON ...

BINOMIAL DISTRIUBITON This  distribution  (also known  as Bernoulli  distribution ) is useful  in such  an experiment where  there  are only two  outcomes success or failure g

Dynamic programming, A company is planning its advertising strategy for the...

A company is planning its advertising strategy for the next year for its three major products.

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