Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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
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
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
The following linear programming is written to plan the production of two products. And the company wants to maximize profits. x1 = number of product 1 produced in each batch
discuss the significance of oparation research
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
discuss applications and scope of operations research in diverse areas.
write down any two assumption of L.P
Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0
Word problems based on formulation of linear programming problems. 2. A manufacturer produces nuts and bolts for industrial machinery. It takes 1 hour of work on machine 1 an
#what is the similarity and difference between transportation and linear programing models?
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
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!
whatsapp: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd