Question
A firm produces two different models of backpack: a classic model and a modem model. Each backpack is worked by three machines: cutting, sewing, polish.
A firm produces two different models of backpack: a classic model and a modem model.
Each backpack is worked by three machines: cutting, sewing, polish. The required processing times are given in minutes in the table below, together with the net profit realized for each backpack
30
40
80
1500
Classic Modem 45 30 15
1000
Cutting Sewing Polish Net profit The cutting and polish machines are available for 5 hours per day, while the sewing machine is available for 8 hours per day. Assuming that all of the backpacks produced are sold formulate a linear programming problem that allows to decide the daily production (not necessarily an integer number of each backpack's model in order to maximize profits while respecting the constraints of production
Write the LP problem longhand and solve it by using the graphical ines method and the comer points method)
solution method (both the profit
Plot the graph with all the required lines (constraints and iso-profit lines); be precise write all the points coordinates on the Xi and x axes you can plot the graph on a paper, take a photo of it and heart into Word, or you can plot it directly in Word)
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started