Solve by computational procedure of big – m method, Operation Research

Assignment Help:

Example 2

Max Z = 3x1 - x2

Subject to

            2x1 + x2 ≥ 2

            x1 + 3x2 ≤ 3

            x2 ≤ 4

    &     x1 ≥ 0, x≥ 0

 

Answer

SLPP

Max Z = 3x1 - x2 + 0s1 + 0s2 + 0s3 - M a1

    Subject to

                        2x1 + x2 - s1+ a1= 2

                        x1 + 3x2 + s2  = 3

                        x2 + s3 = 4

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

 

 

As all Δj ≥ 0, optimal basic feasible solution is achieved. Hence the solution is Max Z = 9, x1 = 3, x2 = 0

 

816_Big_M_Method.png


Related Discussions:- Solve by computational procedure of big – m method

Basis of scientific methods, The scientific methods is based on certain...

The scientific methods is based on certain article of path these are: 1. Reliance on Evidence: Truth is established on the basis of evidence. Conclusion is admitted onl

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

Uncertainly, Uncertainly : There is a great uncertainly about economic a...

Uncertainly : There is a great uncertainly about economic and general environment. With economic growth uncertainty is also growing's. this makes each decisions costlier

Method of calculation of mean deviation, Method of Calculation of Mean  De...

Method of Calculation of Mean  Deviation a. Computation of Mean Deviation Individual Series : The process of computing mean  deviation in case  of individual series involves

Simulation , The Neatee Eatee Hamburger Joint specializes in soyabean burge...

The Neatee Eatee Hamburger Joint specializes in soyabean burgers. Customers arrive according to the following inter - arrival times between 11.00 am and 2.00 pm: Interval-arrival

Solve the following linear programming graphically, Problem based on graphi...

Problem based on graphical solution of a given LPP when feasible region is bounded. 1.    Solve the following linear programming graphically; Maximize and minimize z = 60x+

Z-test - hypothesis testing, Z-Test Prof. Fisher has  given a method  of...

Z-Test Prof. Fisher has  given a method  of testing the significance of the correlation coefficient in small  samples. According  to this method the  coefficient of correlation

#title.L.L.p, #use the simple method to solve the following L.P.P. Maximi...

#use the simple method to solve the following L.P.P. Maximize Z =4X1 +10X2 subject to constraints, 2X1 +X2 2X1+5X2 2X1 +3X2 X1,X2 > 0

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