If the constraints in a linear programming problem are changed

A factory produces two product P_1a n dP_2 . Each of the product P_1 requires 2 hrs for moulding, 3 hrs for grinding and 4 hrs for polishing, and each of the product P_2 requires 4 hrs for moulding, 2 hrs for grinding and 2 hrs for polishing. The factory has moulding machine available for 20 hrs, grinding machine for 24 hrs polishing machine available for 13 hrs. The profit is Rs. 5 per unit of P_1 and Rs 3 per unit of P_2 and the factory can sell all that it produces . Formulate the problem as a linear programming problem to maximize the profit.

One kind of cake requires 200 g of flour and 25 g of fat, and another kind of cake requires 100 g of flour and 50 g of fat. Find the maximum number of cakes which can be made from 5 kg of flour and 1 kg of fat assuming that there is no shortage of the other integredients used in making the cakes. Formulate the above as a linear programming problem and solve graphically.

Find the point which provides the solution of linear programming problem: Maximise: Z=45x + 55y Subject to constraints: x, yge 0,6x + 4y le 120 and 3x + 10y le 180.

A young man rides his motor cycle at 25km/hr, he has to spend Rs 2 per km on petrol, if he rides at a faster speed of 40km/hr, the petrol cost increases to Rs 5/km. He has Rs 100 to spend on petrol and wishes to find maximum distance he can travel within 1 hour. Express this as a linear programming problem and solve it.

One kind of cake requires 200 g of flour and 25 g of fat and another kind of cake requires 100g of flour and 50 g of fat. Find the maximum number of cakes which can be in make from 5 kg of flour and 1 kg of fat, assuming that there is no shortage of other in gradients used in making the cakes. Formulate the above as a linear programming problem and solve it graphically.

Solve each of the following linear programming problems by graphical method. Maximize Z=3x+3y Subject to the constraints x-ylt=1 x+ygeq3 x , ygeq0

Solve each of the following linear programming problems by graphical method. Maximize Z=x+y Subject to -2x+ylt=1 , xlt=2 , x+ylt=3 x , ygeq0

Solve each of the following linear programming problems by graphical method. Maximize Z=30 x+20 y Subject to x+ylt=8 x+4ygeq12 5x+8y=20 x , ygeq0

Solve each of the following linear programming problems by graphical method. Maximize Z=3x_1+5x_2 Subject to x_1+3x_2geq3 x_1+x_2geq2 x_1, x_2geq0

Solve each of the following linear programming problems by graphical method. Maximize Z=2x+3y Subjected to constrent x+ygeq1 , 10 x+ygeq5 , x+10ygeq1 and x , ygeq0