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!
This method is more systematic and orderly than least cost method. Here penalties for each column and row of the transportation table are determined, and the row or column with largest penalty is chosen for allocation. Then the cell with lowest cost form the selected row column is allocated the maximum possible.
After this the row or column whose supply or demand is exhausted is exhausted is deleted and the penalties are again calculated for the shrunken table. The procedure continue still full demand supply is exhausted. Here penalty of each row column = ( second lowest - lowest costs of that row / column.
discuss applications and scope of operations research in diverse areas.
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 paper
what happen if line balancing does not exist
The scientific methods is thus based on certain basic postulate which can be stated as under: a. It relies on empirical evidence: b. It utilizes relevant concepts;
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 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
The Best Corporation is considering making either minor or major repairs to a malfunctioning production process. When the process is malfunctioning, the percentage of defective it
Ranganathan's Principles: Perhaps it would be worthwhile to consider the Five Laws of Library Science of Dr. S. R. Ranganathan as the basic guidelines for formulating the obje
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
A DRUG MANUFACTURER produces 2 products X1 and X2.X1 needs 2 hours on machine A AND 2 HOURS ON MACHINE B.X2 needs 3 hours on machine A and 1 hour on machine B.If machine A can run
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