Problem: Maximizing Car Sales Profits Using PuLP

In this lesson, we will demonstrate the power of the PuLP library by using it to solve a real-life problem. Let’s consider a car manufacturing system where the manufacturer wants to maximize their profits. The following points summarize the problem:

• We have two models of a car: Car A and Car B.
• Car A gives us a profit of $20k while Car B gives us a profit of $45k.
• The designer takes 4 days to build Car A and 5 days to build Car B.
• The engineer takes 3 days to build Car A and 6 days to build Car B.
• The machine takes 2 days to build Car A and 7 days to build Car B.
• The designer, engineer, and machine can all work for 30 days.