Linear Programming exercise using Simplex method. Three products are manufactured on a machine. The setup time of each product is 2, 3 and 4 minutes respectively, and the process time is 3, 2 and 1 minutes. The profit contributed by each product is respectively 12, 10 and 15 MU. There are 100 minutes of machine time and 200 minutes for machine setup. Determine the optimum number of units to manufacture of each item: 1.- Implement the problem in a jupyter notebook using the scipy library or other optimization library to solve the problem and maximize profit. 2.- Use graphs in the jupyter notebook with the matplotlib library to represent the optimal solution in the space of the decision variables, include labels and legends for clear presentation of the graph.
Linear
Three products are manufactured on a machine. The setup time of each product is 2, 3 and 4 minutes respectively, and the process time is 3, 2 and 1 minutes. The profit contributed by each product is respectively 12, 10 and 15 MU. There are 100 minutes of machine time and 200 minutes for machine setup. Determine the optimum number of units to manufacture of each item:
1.- Implement the problem in a jupyter notebook using the scipy library or other optimization library to solve the problem and maximize profit.
2.- Use graphs in the jupyter notebook with the matplotlib library to represent the optimal solution in the space of the decision variables, include labels and legends for clear presentation of the graph.
AI-generated content may present inaccurate or offensive content that does not represent bartleby’s views.
Unlock instant AI solutions
Tap the button
to generate a solution
