Mixed Integer Binary LP. The Gadget Phone Company makes a type of cellular phone and just received an order for 1,500 phones. The phone can be made on either of two machines, or both of them, that each have limited capacities to make the phone. Machine 1 can make up to 1,000 units, and Machine 2 can make up to 800 units of the product. Machine 1 has a variable cost of $100 per phone and a fixed setup cost of $800. Machine 2 has a variable cost of $200 per phone and a fixed setup cost of $1,200. How many phones should be made on each machine to minimize the total cost of producing the 1,500 phones? a. Formulate this problem as a mixed integer LP problem. Minimize: 100 X1+ 200X2 800 Y1 + 1200 Y2 Subject to: X1 X2 -1000 71 1 Y2 X1 1 X2 V IV I IA II II Y1 binary, Y2 binary b. How many phones should be produced on each machine to minimize cost? What is the total cost of production? Machine 1: Produce Machine 2: Produce I phones. phones. Minimum cost = $ c. What are the binding constraints in the optimal solution? Requirement to make 1,500 units Capacity of Machine 1 Capacity of Machine 2 (Click to select) (Click to select) (Click to select)