LINEAR PROGRAMMING EXERCISE, Optimizing the operations per floor in a Factory

The beginning

Since January 2024 I have been studying the book of FrederickS. Hillier “Introduction to Operations Research”, mainly because i have been looking into more trend knowledge about data models, so i can analyse in new ways and for me this book has everything of what i was looking for.

The exercise i have been practicing is the optimization of the resources that a factory has in every floor, so we can find the best combination of numbers that can give the company more profit.

FloorProduct1Product2Available production time per week in hours
1104
20212
33218
Revenue30005000
RestrictionsLinear expressions
For floor 1X1<4
For floor 22×2<12
For floor 33×1+2×2<18

If we reduce the equations we will see this type of graph that tells us what can be the feasible region.

Reducing the formulas to x1>4, x2<6 and 3×1+2×2<18 to 3(0)+2×2=18 that makes x1=9 and 3×1+2(0)=18 to x2=6

The result

Then when we have this we can try different combinations from the feasible region until we have the best one, in this case the best one was 2 and 6, so we can have 36000 of revenue

X1x2Z Revenue
000
0630
2636
4327
4012

Only with this we can have a simple but very good explanation of this type of data models, in this case to optimaze the resources per floor in a company, like the WYNDOR GLASS CO. Factory.

I will publish a dashboard soon so i can explain this in live.



Just to finalize a graph so we can understand the canonic version of the model