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
USE SIMPLE METHOD TO SOLVE THE FOLLOWING LPP MAXIMISE Z=4X1+10X2 SUBJECT TO CONSTRAINS, 2X1+X2 2X1+5X2 2X1+3X2 X1, X2>0
the following table gives place under different states of nature Strategies States of nature s1 s2 s3 A 10000 3000 2000 B
Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X 1, X2 = 0
Line Balancing Methods - Heuristic Approach Heuristic mean serving to find i.e. to find out discover things for oneself. Heuristic describes a particular approach to problem so
the dual form of the following lpp min z=3x1+2.5x2 constraints:2x1+4x2>=40, 3x1+2x2>=50 and x1,x2>=0
What is meant by a mathematical model of a real situation? Discuss the importance of models in the solution of Operations research problems
Periodicals and Serials: Periodical publications form an important part of today's information world. It is one of the oft chosen forms of research communication. There are ov
What is the optimum solution
which job should proceed first among the 2 jobs on n machines by graphical method
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: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd