Home
Class 12
MATHS
(Manufacturing problem) A manufacture...

(Manufacturing problem) A manufacturer has three machines I, II and III installed in his factory. Machines I and II are capable of being operated for at most 12 hours whereas machine HI must be operated for atleast 5 hours a day. She produces onl

Promotional Banner

Similar Questions

Explore conceptually related problems

(Manufacturing problem) A manufacturer has three machines I, II and III installed in his factory. Machines I and II are capable of being operated for at most 12 hours whereas machine III must be operated for atleast 5 hours a day. She produces only two items M and N each requiring the use of all the three machines. The number of hours required for producing 1 unit of each of M and N on the three machines are given in the following table : She makes a profit of Rs. 600 and Rs. 400 on items M and N respectively. How many of each should she produce so as to maximise her profit assuming that she can sell all the items that she produced? What will be the maximum profit ?

(Manufacturing problem) A manufacturer has three machines I , II and III installed in his factory. Machines I and II are capable of being operated for at most 12 hours where as machine III must be operated for atleast 5 hours a day. She produces only two items M and N each requiring the use of all the three machines. The number of hours required for producing 1 unit of each of M and N on the three machines are given in the following table: She makes a profit of Rs 600 and Rs 400 on items M and N respectively. How many of each item should she produce so as to maximise her profit assuming that she can swll all the items that she produced ? What will be the maximum profit ?

(Manufacturing problem): A manufacturer has three machines. I, II and III installed in his factory. Machines I and II are capable of being operated for at most 12 hours whereas machine III must be operated for atleast 5 hours a day. She produces only two items M and N each requiring the sue of all the three machines. The number of hours required for producing 1 unit of each of M and N on the three machies are given in the follownig table: She makes a profit of Rs. 600 and Rs. 400 on items M and N respectively. How many of each item should be produce so as to maximise her profit assuming that she can sell all the items that she produced? What will be the maximum profit?

A manufacturer has three machines I, II and III installed in his factory. Machines I and II are capable of being operated for at most 12 hours whereas machine III must be operated for at least 5 hours a day. She produces only two items M and N each on the three machines are given in the following table: SHe makes a profit of Rs 600 and Rs 400 on items M and N respectively. How many of each item should she produce so as to maximise her profit assuming that she can sell all the items that she produced? What will be the maximum Profit?

A manufacturer has 3 machines I, II and III installed in his factory. Machines I and II are capable of being operated for utmost 12 hours whereas machine III must be operated atleast for 5 hours a day. He produces only two items A and B each requiring the use of three machines. The number of hours required for producing 1 unit of each of the items A and B on the three machines are given below. He makes a profit of Rs 7600 on item A and Rs 400 on item B. Assume that he can sell all that he produces. (i) Formulate this as a linear programming problem. (ii) Solve the L.P.P by corner point method.

A tyre manufactureing company produces tyres of cars and buses. Three machines A, B, C are to be used for the production of these typres. Machines A and C are available for operation atmost 11 hours, whereas B must be operated for atleast 6 hours a day. the time required for construction of one typre the three machines given in the following table. Comapy sells all the tyres and gets a profit of Rs. 100 Rs 150 on a tyre of a car and bus respectively. The company wants to know how many numbers of each item to be produced to maximise the profit. To formulate a linear programmining problem, (i) Write the objective function. (ii) Write all constraints.