8. LP Modeling: Production Planning
The chapter discusses the application of Linear Programming (LP) for production planning in a carpet manufacturing company. It outlines the intricacies of managing workforce, overtime production, hiring, firing, and storage costs linked to fluctuating demand. The chapter emphasizes how to formulate these aspects into a linear programming model to optimize costs while maintaining production efficiency.
Enroll to start learning
You've not yet enrolled in this course. Please enroll for free to listen to audio lessons, classroom podcasts and take practice test.
Sections
Navigate through the learning materials and practice exercises.
What we have learnt
- Linear Programming is an effective method for optimizing production processes.
- Understanding the relationship between workforce management and production output is crucial in demand variability.
- Constraints in LP models must be taken into account to produce workable and realistic solutions.
Key Concepts
- -- Linear Programming
- A mathematical method used for optimization where the objective is to maximize or minimize a linear function subject to constraints that are also linear.
- -- Simplex Algorithm
- An algorithm used to find the maximum or minimum of a linear function by iterating through vertices of the feasible region defined by the constraints.
- -- Dual Problem
- In linear programming, the dual problem relates to a linear program's constraints, providing bounds on the primal problem's objective value.
- -- Integer Linear Programming
- A type of linear programming in which solutions are constrained to be integers, posing a greater computational challenge than standard LP.
- -- Activity Variables
- Variables representing different activities in the context of production, such as the number of carpets made, workers hired, or overtime produced.
Additional Learning Materials
Supplementary resources to enhance your learning experience.