2.
Linear Programming
Definition:
Linear Programming (LP) is a method for finding the best outcome in a mathematical model
with linear relationships, subject to constraints.
Purpose:
To maximize profit, minimize cost, or achieve optimal resource allocation.
Components of an LP Problem:
● Decision Variables: What you are solving for (e.g., how many units to produce)
● Objective Function: The function to be optimized (e.g., profit = 5x + 3y)
● Constraints: Limitations (e.g., labor hours, material availability)
● Feasible Region: Set of possible solutions satisfying all constraints
Solving Methods:
● Graphical Method: For two-variable problems, visualize the solution region.
● Simplex Method: For complex problems with more variables.
● Software: Excel Solver, LINGO, Python (PuLP)
Applications:
● Production planning
● Transportation and logistics
● Workforce scheduling
● Diet and nutrition planning
● Financial portfolio optimization
Assumptions:
● Linearity in equations
● Deterministic environment
● Additivity and divisibility
● Non-negativity of variables