In a factory, chairs and tables are manufactured using two different machines M1 and M2. The...

 

Transcribed Image Text:

In a factory, chairs and tables are manufactured using two different machines M1 and M2. The time required to make the chair using M1 and M2 is 3 hours, and 2 hours, respectively. The time needed to make a table using M1 and M2 is 1 hour and 2 hours, respectively The maximum time available (in hrs) for the machines M1 and M2 are 5 and 4. The profit on chair is 4 R.O while that on a table is 6 R.O. Formulate this as a linear programming problem and find the maximum profit using the algebraic method? In a factory, chairs and tables are manufactured using two different machines M1 and M2. The time required to make the chair using M1 and M2 is 3 hours, and 2 hours, respectively. The time needed to make a table using M1 and M2 is 1 hour and 2 hours, respectively The maximum time available (in hrs) for the machines M1 and M2 are 5 and 4. The profit on chair is 4 R.O while that on a table is 6 R.O. Formulate this as a linear programming problem and find the maximum profit using the algebraic method?