Linear Programming

Please show all 5 parts! Some questions only want things formulated or identified, not solved! Thanks!!

1. Identify the three components of the following Linear Programming problem. DO NOT SOLVE THE PROBLEM!! - Maximize 501+1202 S.T.X1+X2=0 2. A workshop has three (3) types of machines A,B and C; it can manufacture two (2) products 1 and 2, and all products have to go to each machine and each one goes in the same order; first to A, then to machine B and then to C. The following table shows: - The hours needed at each machine, per product unit - The total available hours for each machine, per week - The profit of each product per unit sold - Formulate and solve using the graphical method a solution that allows the workshop to maximize its total product profit. 3. Formulate and solve the following Linear Programming Minimization problem. - Minimize 24X + 15Y S.T.7X+11Y>=7716X+4Y>=80X,Y>=0 4. Green Vehicle Inc. manufactures electric cars and small delivery trucks. It has just opened a factory where the C1 car and T1 truck can both be manufactured. To make either vehicle, processing in the assembly shop and in the paint shop are required. It takes 1/40th of a day and 1/60th of a day to paint a T1 truck and a C1 car in the paint shop, respectively. It takes 1/50th of a day to assemble either type of vehicle in the assembly shop. A T1 truck and a C1 car yield profits of $300 and $220, respectively, per vehicle sold. Formulate and solve using the graphical method a solution that allows Green Vehicle Inc. to maximize its total product profit. 5. Formulate, do not solve, the following Linear Programming problem. Leach Distributors packages and distributes industrial supplies. A standard shipment can be packaged in a class A container, a class K container, or a class T container. A single class A container yields a profit of $9; a class K container, a profit of $7; and a class T container, a profit of $15. Each shipment prepared requires a certain amount of packing material and a certain amount of time. Formulate the LP problem which will enable Leach to identify the optimal number of each class of container to pack each week. DO NOT SOLVE