Linear programming is a simple technique where we depict complex relationships through linear functions and then find the optimum points. The important word in the previous sentence is depicted. The real relationships might be much more complex – but we can simplify them to linear relationships.
To build an optimization model that guide our manpower (call agents) allocation for survey works in order to complete all survey projects in a timely manner.
- Streamlit - Data Driven Web-based apps
- Google OR-Tools - Linear Optimization
- Each jobs have it own dateline, to re-visit the solution approach to relocate the manpower once any of the job's dateline has completed.
- To formulate a mitigation action if the model unable to find an optimal solution.
i. To declare dateline as another manipulative vars.
Remark: Problem with more than 1 manipulative vars can be a non-linear programming
ii. Constraint Programming
CP is based on feasibility (finding a feasible solution) rather than optimization (finding an optimal solution) and focuses on the constraints and variables rather than the objective function. The goal may simply be to narrow down a very large set of possible solutions to a more manageable subset by adding constraints to the problem.