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, x2  ≥ 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, a1  ≥ 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

Objectives of measuring dispersion - measure of dispersion, Objectives of M...

Objectives of Measuring Dispersion a. To judge the Reliability  of Measures of Central Tendency: Measure of dispersion  is the  only means  to test the  representative charac

Operation Research Models, Explain the classification of models 1. Classifi...

Explain the classification of models 1. Classification by function or uses 2. Classification by degree of qualification 3. Classification by physical characteristics 4. Classidicat

Linear programning, b. A paper mill produces two grades of paper viz., X an...

b. 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

Duality, Formulation of convert to primal method to dual in lpp

Formulation of convert to primal method to dual in lpp

formulate the optimality equations, Each day you own 0 or 1 stocks of cert...

Each day you own 0 or 1 stocks of certain commodity. The price of the stock is a stochastic process that can be modeled as a Markov chain with transition rates as follows

Problems based on lpp when feasible region is unbounded, Problems based on ...

Problems based on LPP when feasible region is unbounded.     1.    Minimize z = 3x + 5y subject to constraints  X + y ≥ 2 X + 3y ≥ 3 X, y ≥ 0 script

Simplex, Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4...

Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4x + 8y >= 5

Both LP and PIP, marginal rate of substitution, degeneracy and degenerate ...

marginal rate of substitution, degeneracy and degenerate solution

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