A telecom company manufactures mobile phones and landline phone. They require 9 hours to make a mobile phone. The company can work not more than 1000 hours per day. The packing department can pack at most 600 telephones per day. If x and y are the set of mobile phones and landline phones, respectively , then the inequalities are :

A company manufactures two types of telephone sets A and B . The A type telephone requires 2 hour and B type telephone requires 4 hours to make . The company has 800 work hours per day . 300 telephones can pack in a day . The selling prices of A and B type telephones are Rs.300 and 400 respectively . For maximum profits company produces x telephones of a type and y telephones of B types . Then except xge0 and yge0 , linear constraints and the probable region of the LPP is of the type .

A manufacturer produces two types of steel trunks. He has tow machines A and B. For completing, the first types of the trunk requires 3 hours on machine A and 3 hours on machine B, whereas the second type of the trunk requires 3 hours on machine A and 2 hours on machine B. Machines A and B can work at most for 18 hours and 15 hours per day respectively. He earns a profit of Rs. 30 and Rs. 25 per trunk of the first type and the second respectively. How many trunks of each type must he make each day to makes maximum profit?

A manufacture produceds two types of steel trunks. He has two machines, A and B. The first type of book case requires 3 hours on machine A and 3 hours on machine B for completion whereas the second type required 3 hours on machine A and 2 hours n machine B. Machines A and B can work at most for 18 hours and 15 hours per day respectively. He earns a profit of Rs.30 and Rs.25 per trunk of the first type and second type respectively. How many trunks of each type must he make each day to make the maximum profit?

Manufacturer produces two types of steel trunks. He has two machines, A and B. The first type of trunk requires 3 hours on machine A and 3 hours on machine B. The second type requires 3 hours on machine A and 2 hours on machine B. Machines A and B can work at most for 18 hours and 15 hours per day respectively. He earns a profit of Rs. 30 per trunk on the first type of trunk and Rs. 25 per trunk on the second type. Formulate a linear programming problem to find out how many trunks of each type he must make each day to maximize his profit.

Machine X can pack 30 articles per hour and machine Y can pack 35 articles per hour. Machine X works for x hours per day and machine Y works for y hours per day and both the machines pack at least 2500 articles in a day. Frame and inequation to represent the above data.

Machine X can pack 30 articles per hour and machine Y can pack 35 articles per hour. MachineX works for x hours per day and machine Y works for y hours per day and both the machinespack at least 2500 articles in a day.Frame an inequation to represent the above data.