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!
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
solution
1. Let z = 3x + 5y
2. Let us Draw the line x + y = 6 and x + 3y = 3 using suitable points on the graph.
3.These lines intersect at
4. Now shade the region of intersection of these lines
5.Vertices of shaded feasible region are
Now,
At C(3,0)
At P(3\2,1\2)
At B(0,2)
Therefore at P(3\2,1\2), z=3x+5y is minimum
P(3\2,1\2)
(3,0) P(3\2,1\2) and B(0,2)
Z= 3x + 5y
Z= 9
Z= 7
Z= 10
What is meant by a mathematical model of a real situation? Discuss the importance of models in the solution of Operations research problems
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
variuos types with example
In large sized linear programming problems, the solution cannot be obtained by the graphical method and hence a more systematic method has to be developed to find
NON PARAMETRIC TESTS All practical data follow normal distribution under such situations can estimate the parameters such as mean variance etc ,,, and use the standard
Briefly discuss the concept of Reporting Entity in SAC 1 How asset is defined and recognised under the AASB Framework? Silver Developers Ltd is a property development company
RANGE Range is the difference between the highest and the lowest value is series. This is the simplest absolute measure of dispersion. Symbolically : R= L- S
1. Determination to enter a new territories. 2. To decide to enter a new market or not. 3. To determine how much production capacity to be builds up. 4. Helpful in
disadvantages of model in operational research
Solve the following Linear Programming Problem using Simplex 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: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd