1. The problem statement, all variables and given/known data AutoIgnite produces electronic ignition systems for automobiles at a plant in Cleveland, Ohio. Each ignition system is assembled from two components produced at AutoIgnite’s plants in Buffalo, New York, and Dayton, Ohio. The Buffalo plant can produce 2000 units of component 1, 1000 units of component 2, or any combination of the two components each day. For instance, 60% of Buffalo’s production time could be used to produce component 1 and 40% of Buffalo’s production time could be used to produce component 2; in this case, the Buffalo plant would be able to produce 0.6(2000) = 1200 units of component 1 each day and 0.4(1000) = 400 units of component 2 each day. The Dayton plant can produce 600 units of component 1, 1400 units of component 2, or any combination of the two components each day. At the end of each day, the component production at Buffalo and Dayton is sent to Cleveland for assembly of the ignition systems on the following work day. a. Formulate a linear programming model that can be used to develop a daily production schedule for the Buffalo and Dayton plants that will maximize daily production of ignition systems at Cleveland. b. Find the optimal solution. 2. Relevant equations I'm not sure what this means exactly. 3. The attempt at a solution Let x equal % of time producing C1 in B Let y equal % of time producing C1 in D Let 1-x equal % of time producing C2 in B Let 1-y equal % of time producing C2 in D C1 produced: 2000x+600y <= 0 C2 produced: 1000(1-x)+1400(1-y)<=0 Iginitions are made of a C1 and a C2. Therefore, set the equations equal to eachother? 2000x+600y=1000(1-x)+1400(1-y) 3000x+2000y= 2400 0<=x,y <=1 Then I graph the line of where C1 and C2 are equal and the line of C1 and the line of C2. I take the coordinates where C1 crosses with the equality line and where c2 crosses with the equality line. But when I plug those into the equation, I get 2400 for both, which leads me to believe it's wrong.