A and B on which the profits earned per unit are ` and ` respectively. Each product is processed on two machines M and M . Product A requires one minute of processing time on M and two minutes on M , While B requires one minute on M and one minute on M . Machine M is available for not more than hrs minutes while M is available for hrs during any working day.
Formulate this problem as a linear programming problem to maximize the profit. . A firm manufactures pills in two sizes A and B . Size A contains mgs of aspirin, mgs of bicarbonate and mg of codeine.
Size B contains mg. of aspirin, mgs. of bicarbonate and mgs. of codeine.
It is found by users that it requires atleast mgs. of aspirin, mgs.of bicarbonate and mgs. of codeine for providing immediate relief. It is required to determine the least number of pills a patient should take to get immediate relief.
Formulate the problem as a standard LLP. . Solve the following linear programming problem graphically. Maximise Z subject to the constraints ; and $ $ .
Solve the following linear programming problem graphically. Minimize Z subject to the constraints: ; $ # and $ $ . Solve the following linear programming problem graphically. Maximize Z subject to the constraints: ; and x x $ .
Solve the following linear programming problem graphically. Maximize Z subject to the constraints: ; and x x $ . Draw a network diagram for the following activities. Activity code A D E F G H I J K Predecessor activity – C C,D E,F G,H I,J .
Draw the network diagram for the following activities Activity code D E F G Predecessor activity – – D,E . A Project has the following time schedule Activity - - - - - - Duration (in