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
A factory employs unskilled workers earning $135 per week and skilled workers earning $270 per week. It is required to keep the weekly age bill below $24,300. The machine requires
Assumption of F- Test The theoretical assumption on which F test is based are: 1.The populations for each sample must be normally distributed with identical mean
A company produce three sizes of windows fans small,medium and large. The manager has formulated an LP model for production.
Stratified Sample Size The sampling study has depended much on the stratified sample to reduce the sampling error, samples size may have a number of strata or cluster
QUESTION a) "Organizations have to change only because changes in their external environments force them to change." Discuss b) What restraining forces may block the impleme
Solve the following Linear Programming Problem using simple method Maximize Z= 3x1 + 2x2 Subject to the constraints: X1 + X2 = 4
One Sample sign Test In a one sample test the null hypothesis μ = μ 0 against an appropriate alternative on the basis of a random sample of size n we replace each sam
scope of operation research in management
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
difference between simplex solution procedure for maximisation and minimisation
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