Two-variable resource allocation
Maximize a linear objective for two nonnegative quantities under resource inequalities and inspect the optimum vertex.
The example value has been entered. Check it immediately or change the value.
Input is processed in the browser. Refreshing returns a sample value.
Instructions and example
max(px+qy); ax+by≤c; x≥0,y≥0
Under x+y≤4 and 2x+y≤5, the maximum of 3x+2y is 9 at x=1, y=3.
At most 20 constraints; integer coefficients 0–1,000,000 and limits 0–1,000,000,000. Both variables need finite bounds. Continuous solutions only; no integer quantities, equalities or negative coefficients. Floating-point results display at most 12 significant digits.
Frequently asked questions
Can the resource-allocation solution be fractional?
Yes. This continuous linear program permits fractional quantities. Use the knapsack tool for indivisible item selection.
What if several resource allocations share the maximum?
The first optimal vertex encountered in constraint order is shown. All optimal allocations are not enumerated.
Calculation criteria and reference materials
- Google OR-Tools: linear programming
Continuous objective maximization under linear inequalities.
Verification of calculation criteria: · Calculation·verification principles · Report errors