LP with Feasbl

Linear programming is an optimization method for problems that can be expressed with linear relationships. A linear program has decision variables, an objective to minimize or maximize, and constraints that define the feasible region.

Use LP with Feasbl when the main question is how to allocate limited resources, balance tradeoffs, or choose quantities while respecting capacity, demand, budget, or timing limits. Common examples include production planning, assignment, scheduling, routing approximations, and cost optimization.

In Feasbl

• Model numeric decisions, linear constraints, and objectives.
• Run optimization jobs through Feasbl's hosted API.
• Pair LP models with planning or constraint programming when a workflow has both numeric tradeoffs and discrete feasibility rules.

Continue with the API overview or the developer reference.