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!
Exercise
Machine
Time per unit (mins)
Machine capacity
Min /day
Product 1
Product 2
Product 3
M1
2
3
440
M2
4
-
470
M3
5
430
It is required to determine the daily number of units to be manufactured for each product. The profit per unit for product 1, 2 and 3 is Rs. 4, Rs. 3 and Rs. 6 respectively. It is assumed that all the amounts produced are consumed in the market. Formulate the mathematical model for the model.
Steps of Research Process The steps of research process have already been discussed in theory. Here we shall outline the procedure of conducting the research. i) Formulate t
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
The scientific method in O R study generally involves the followings three phases: 1. Judgment phase, 2. Research phase 3. Action phase
A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we
#questionA 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 grad
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
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 pape
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
how jaguar implements aggregate planning?
Problems based on LPP when feasible region is a line segment or it does not exist. 1. Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X, y ≥ 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