Two Product Resource Mix Optimizer
Maximize an entered linear contribution from two continuously divisible products under shared resource capacities.
YOUR CALCULATION
Result
—
Calculation steps
Work through one step at a time or reveal the complete calculation. The steps use your current inputs.
How to calculate
Enumerate nonnegative-axis intercepts and pairwise resource-boundary intersections. Keep feasible corners and choose one with maximum objective value.
Maximize cA A+cB B subject to ai A+bi B≤capacityi and A,B≥0
Worked example
Maximize 3A+2B subject to A+B≤4 and 2A+B≤5. The optimum is A=1, B=3 with contribution 9.
Assumptions and input details
One to twenty resources; nonnegative resource coefficients and capacities. Each product must be bounded by some resource, and each row must constrain at least one product. Positive coefficients at least 1e−6, at most 1e9; optimal quantities capped at 1e12. Continuous fractional quantities are permitted; integer batch sizes, minimum orders and setup costs are not modeled. Contributions must share one meaning/unit. Numerical feasibility tolerance is 1e−9 times max(1,capacity); nearly parallel boundaries may be unresolved. One optimal corner is shown if several tie.
Using this calculator
Can I enter my own problem?
Yes. Replace the example values with your own inputs. The result, calculation steps, tables and applicable diagrams update from those inputs. Blank or invalid values clear the result; example values are never silently substituted for missing inputs.
Are the results exact?
Results use floating-point arithmetic and displayed rounding. Read the formula, assumptions and any stated data precision before interpreting the result.
Is my input uploaded?
The calculation runs in your browser. No account, file upload or external AI service is required. Inputs are not saved between page reloads.
Calculate earliest and latest task times, total slack and critical tasks in a dependency network.
Search all feasible combinations of independent indivisible projects to maximize entered-cash-flow NPV within an upfront budget.
Compare cumulative-average and individual-unit learning models and calculate time for an additional batch.
Reserved advertising space.