Skip to content
Opt Dir

Manufacturing ยท Weekly-Monthly Product Mix Decision

How Much of Each Product Should I Make for the Most Profit?

Manufacturing 5 min read
#product mix #which order first #max profit #bottleneck machine #raw material sharing #weekly production plan #monthly production plan

If you share the same machines, the same raw material and the same labour across several products, what you decide to make this week sets your margin โ€” in the literature this is the Product Mix problem, a classical application of linear programming (LP).

In plain words

You run a 5-50-worker shop making 3-15 products. The same raw material, the same machines and the same workers are shared across products. Each week sales says ‘we can sell 200 more of this’, production says ‘but that machine is full’, accounting says ‘product A has the highest margin, push that one’. Each product has a different margin, a different machine-hour consumption, a different raw-material usage and a different demand ceiling. Decide by gut and you usually load the product with the highest sale price โ€” yet the product that eats the least bottleneck-machine hour can be more profitable. Take this call by intuition and 10-25% of the monthly margin you could earn from the same capacity stays on the table.

Sound familiar?

  • We make 3-15 products, all sharing the same raw-material stock and the same machines โ€” one product's run steals capacity from another.
  • Sales accepts new orders every week, production promises 'this time it'll fit', then we jam at the bottleneck machine.
  • When we pick how much of each product to make, we apply 'prioritize the highest sale price' โ€” but maybe that product is the one that eats the bottleneck the longest.
  • Unit margin is in accounting. But **'margin per machine-hour'** or **'margin per kilogram of raw material'** is not โ€” nobody calculates this.
  • At month-end we sometimes look back and say 'if we'd made less of X, we could have fit Y'; with that info up front, we would have decided differently.
  • In a raw-material shortage (imported line, FX shock, supplier delay) we re-argue from scratch which product to keep and which to cut.
  • Customer demand caps the maximum we can sell of each product per week โ€” this ceiling has to be in the plan, but the spreadsheet is always done by hand.

Why it matters

The cost of an intuitive product-mix call is well measured in industry data: (1) Loading the highest-price product usually shrinks margin per bottleneck-machine hour โ€” this is the core of the approach known as Theory of Constraints: the correct measure is not unit profit but margin per scarce-resource hour. (2) If the mix is not re-computed in a raw-material price jump, month-end margin drops 3-8 percentage points (range observed in Turkish manufacturer-association reports). (3) Ignoring the customer demand ceiling produces unsold inventory; capital tied in unsold stock costs 20-35% per year (Central Bank of Turkey average TRY funding rate, 2024 observation). (4) When two bottlenecks are tight at once โ€” e.g. both paint line and sewing line jammed โ€” intuition cannot solve it, too many combinations to compare. In side-by-side studies, shops that solve product mix with linear programming (LP) earn 10-25% more margin per bottleneck-hour than shops that decide by gut. For a 50-200M TRY-revenue mid-size manufacturer, that is an extra 1-8M TRY of yearly margin.

How it's solved

Technical depth

One-liner: Among products competing for the same machine, prioritize the one that earns the most money per hour on the machine โ€” not the one with the highest sale price. The call has three stages.

1. Set up the numbers. For each product you need: unit margin (sale price minus variable unit cost โ€” TRY/unit, from accounting), machine-hours/unit, kilograms raw material/unit, labour-hours/unit, and the maximum the customer can absorb per week or month (demand ceiling). Then for each resource, write the capacity: weekly/monthly machine-hours available (net of planned maintenance and stoppages), kilograms of raw-material arrivals, net labour-hours. This table is the input to linear programming: the objective is to maximize the total of (quantity ร— unit margin) across all products; the constraints are that resource consumption must not exceed capacity, and each product cannot exceed its demand ceiling.

2. Let the computer solve it. A spreadsheet solver add-in (Solver) or an open-source solver returns the optimum mix in seconds. Three useful pieces of information come out:

  • Optimum mix: how many units of each product to make.
  • Shadow price (for each bottleneck resource): “If I had one more hour/kilogram of this resource, how much would my monthly margin grow?” If the filling line’s shadow price is 47 TRY/hour, one extra hour of filling-line capacity is worth 47 TRY of extra margin.
  • Slack (idle capacity): resources the model never fills. Extra investment in these resources is wasted.

The shadow price alone is a powerful decision tool: if the filling line’s shadow price is 47 TRY/hour and the overtime premium is 25 TRY/hour, opening overtime is worth it โ€” 22 TRY of extra margin per hour. The other way round (shadow price 18 TRY/hour, overtime premium 25 TRY/hour), overtime would lose money.

If quantities must be whole numbers (no half units), the solver runs as Mixed Integer Programming (MIP); medium-scale still solves in minutes. If demand is uncertain โ€” say the customer might order anywhere between 100 and 300 this week โ€” scenario-based or risk-buffer (robust) extensions take over.

3. Wire it into operations. The output becomes a weekly or monthly production order: quantity per product, machine fill rate, shadow-price report. Data flow: unit margin from accounting, demand ceiling from sales, resource capacities from production. In the monthly planning meeting, sales-production-finance all read the same table. When raw-material prices jump, FX moves, or a new order arrives โ€” the model re-solves, the mix updates. This rolling horizon (re-solving every week or month) is essential because demand and capacity drift continuously.

Alternatives

Gut feel + spreadsheet ranking

Free

Zero licence

Who it fits: 2-4 products, single bottleneck, stable raw-material price

  • + Zero software cost
  • + On-the-spot decision, flexible
  • + Acceptable result for few products and a single bottleneck
  • โˆ’ Beyond 5 products the human mind cannot correctly rank margin per bottleneck-hour
  • โˆ’ Two bottlenecks tight at once cannot be solved by intuition
  • โˆ’ Shadow price stays hidden โ€” extra-machine and extra-shift investments are made without data
  • โˆ’ Raw-material price jumps don't trigger a re-computation

Spreadsheet solver add-in (Solver)

low

No extra licence (bundled with office suite) or low annual subscription

Who it fits: 5-25 products, 5-15 resource constraints, monthly cycle

  • + Inside the office suite already in use, no new software
  • + Linear-programming solver returns the optimum in minutes
  • + Shadow-price and sensitivity report come out for free
  • + Operations team can learn it in 1-2 weeks
  • โˆ’ Spreadsheets are error-prone โ€” a shifted formula goes unnoticed
  • โˆ’ Version control is hard (who updated which copy)
  • โˆ’ Beyond 200 variables, spreadsheet solvers slow down
  • โˆ’ Automatic data flow needs a macro or script

ERP production module + LP plug-in

Enterprise

Core licence included; custom LP plug-in 60K-250K TRY one-off or 40K-120K TRY annual (Turkey market observation)

Who it fits: Mid-size manufacturer, 10-50 products, multi-shift

  • + Stock, sales and cost data are already integrated in the ERP
  • + Local-language UI, local support
  • + Automatic data flow โ€” no manual transfer
  • + Multi-user, role-based access
  • โˆ’ Standard ERP modules usually do not include LP โ€” custom development needed
  • โˆ’ Shadow-price and sensitivity reports missing from most packages
  • โˆ’ Scenario support under uncertainty is weak

Open-source solver + custom product-mix module

Open Source

Licence free; in-house development 6-14 weeks or 200K-700K TRY consultancy

Who it fits: Manufacturer with a tech team, integration into existing systems desired

  • + No licence fee
  • + Linear and mixed-integer solvers are mature; million-variable problems solve in seconds
  • + Uncertainty and rolling-horizon extensions are documented in the open literature
  • + Stochastic and robust LP extensions are easy to add
  • โˆ’ Needs an in-house LP expert and an integration team
  • โˆ’ Prototype-to-production move takes 3-6 months
  • โˆ’ Maintenance stays in-house

Recommendation

Small
2-5 products, single bottleneck: a spreadsheet solver add-in is enough. Half a day to set up + 2-3 hours to validate. A margin-per-bottleneck-hour report typically lifts monthly margin by 5-15%. A separate optimization-software investment does not pay back at this scale.
Medium
5-25 products, 3-10 bottleneck resources: either a spreadsheet solver with macro automation (low cost, medium flexibility), or a custom LP plug-in on top of the ERP (high automation, medium flexibility). 3-6 month pilot. Expected monthly margin improvement 10-20%, with extra-machine or extra-shift investments backed by shadow-price reports. Payback 9-18 months.
Large
25+ products, multi-plant, demand uncertainty: an open-source solver-backed stochastic or robust product-mix model + ERP integration. 6-12 month rollout. Annual investment 400K-1.5M TRY. Monthly margin improvement 15-25%; the shadow-price report on the executive dashboard anchors capital-allocation decisions in data.

Ask in the meeting

  • What method does the product-mix model use โ€” continuous linear programming (LP), integer programming (MIP), or simple ranking?
  • Up to what scale (number of products ร— number of resources) does solve time stay practical (seconds, minutes, hours)?
  • Are shadow prices and sensitivity reports in the main output, or in a separate module?
  • Under demand uncertainty, is scenario-based or robust planning supported, or only a single point forecast?
  • When raw-material price or FX moves, how is the data flow set up to re-compute the mix โ€” hourly, daily, or manually triggered?
  • Does the model read unit cost, stock levels, machine calendars and the order pool automatically from our existing ERP, or via spreadsheet exports?
  • During the pilot (12-16 weeks) on real demand and capacity data, what margin-improvement report do we get vs. the manual decision?
  • If the contract ends, in what standard format can we export model parameters, solution history and shadow-price history?

Technical details

Editor’s note

This problem is colloquially called ‘what should I produce?’, ‘which order has priority?’ or ‘product mix’. In academic terms it is the Product Mix Problem or Resource Allocation Linear Programming; it was the first wide industrial application of linear programming (LP โ€” the math method that finds the best mix under constraints). After George B. Dantzig developed the simplex algorithm in 1947, the first industry to apply LP in the 1950s was oil refining (mixing gasoline / diesel / asphalt from refinery output for maximum profit); from there it spread to all manufacturing and food industry.

Not to be confused with problem 44 (Aggregate Production Planning โ€” APP). APP sits one layer above: across a 3-18 month horizon it jointly decides production rate, inventory, workforce, hire-fire, overtime and subcontracting. Product Mix LP is smaller and single-period: this week or this month, with capacity and raw material treated as given, decide how much of each product to make. APP gives monthly product-family rates; Product Mix LP breaks those into weekly product-level quantities.

Not to be confused with problem 16 (Wagner-Whitin lot sizing) either. Wagner-Whitin is single-product, multi-period: “produce this month, how much?” โ€” the trade-off between setup cost and holding cost. Product Mix LP is multi-product, single-period scarce-resource allocation. They combine: Product Mix LP picks how much of each product this period, then Wagner-Whitin sets each product’s lot size.

The most often missed point: The decision should be made by margin per bottleneck-machine hour, not by unit profit. Eliyahu Goldratt’s Theory of Constraints insists on this: use each bottleneck-machine hour for the product that brings the most margin, not the highest sale price. A product giving 1000 TRY profit per unit and using 4 hours of the bottleneck returns 250 TRY/hour on that machine. Another giving 600 TRY profit per unit and using 1.5 hours returns 400 TRY/hour. The second one wins. Gut feel almost always picks the first, because its unit profit is bigger โ€” but per hour, the table flips.

Second often-missed point โ€” reading the shadow price. The LP gives a marginal value for each bottleneck resource: “if I had one more hour of this resource, how much would my monthly margin grow?” Say it comes out as 380 TRY/hour. Compare with overtime premium: if the premium is 250 TRY/hour, opening overtime pays (net 130 TRY/hour). If the shadow price were 180 TRY/hour, overtime would lose money. The same number anchors the payback calculation for a new machine or a subcontractor deal.

Step-by-step path โ€” for an SMB

Stage 1 โ€” Measure first, plan second. For the next 4-12 weeks, collect per product: unit margin (sale price minus variable unit cost โ€” read to the kuruลŸ from accounting), bottleneck-machine hour/unit, kilograms raw material/unit, labour hour/unit, weekly customer demand ceiling. Capacity inventory: weekly net machine hours (minus planned maintenance, shift changes and stoppages), weekly raw-material stock arrivals, weekly net labour hours.

Stage 2 โ€” Set up the model. In a spreadsheet, one row per product, one column per resource. With the Solver add-in, declare decision variables (quantity of each product), constraints (total consumption of each resource cannot exceed capacity, each product cannot exceed its demand ceiling, quantities cannot go below zero), and the objective (maximum total margin). As a pilot, solve last week’s real situation (real order pool, capacity, prices); compare the output to the call you made by hand. A first pilot typically shows 5-15% margin improvement.

Stage 3 โ€” Automate. Data flow: unit margin from accounting, demand ceiling from sales, resource capacities from production. The weekly model runs on its own, the output drives the production schedule and the sales order-acceptance call. Shadow-price report appears on the monthly management dashboard.

Stage 4 โ€” Roll out. Over 6-12 months: full product line, multi-bottleneck, automatic re-computation when raw-material prices change, shadow-price-based recommendations for extra-machine or extra-shift investment. If demand uncertainty is material, add a stochastic or robust extension as a separate module.

Risks โ€” what can go wrong

  1. Unit-cost error. Unit margin comes from accounting; if overhead is misallocated (e.g. shared machine cost split equally rather than by usage), the decision pushes the wrong product. Audit the cost system first.
  2. Demand-ceiling error. Overstate the demand ceiling and the optimum turns into unsold inventory; understate it and the margin you could have earned slips away. Anchor the ceiling in sales actuals from the last 6-12 months, not a forecast.
  3. Bottleneck drift. As the mix changes, the bottleneck machine can change too; the assumption that the same machine stays tight grows stale. Monthly re-solve plus a shadow-price report keeps an eye on the bottleneck.
  4. Raw-material uncertainty. A single-point LP is fragile under price or supply shocks. For critical materials, run 2-3 scenarios (base / low / high) as multi-scenario or robust LP. Single-supplier dependence locks the product mix to that supplier’s state.

Solver landscape โ€” a technical view

ApproachTypical scaleSolve timeGuaranteed optimum?
Gut feel + ranking2-4 products, single bottleneckinstantNo, 30-50% gap from optimum
Margin-per-bottleneck-hour ranking (Goldratt 1984)3-8 products, single bottleneckminutesYes for single bottleneck
Spreadsheet LP solver add-in5-50 products, 5-20 resourcessecondsYes
Integer programming (MIP)5-50 products, 5-30 resourcesseconds-minutesYes
Scenario-based (stochastic) LP10-100 products, multi-scenariominutesYes, scenario count limited
Risk-buffer (robust) LP10-100 products, uncertainty budgetminutesYes

Objective choice:

  • Maximize total margin: standard objective. Sum of (quantity ร— unit margin) across all products.
  • Maximize customer fulfilment rate: if strategic-customer order completion is the priority, weight key products higher within the demand ceiling.
  • Minimum bottleneck idle: maximum capacity utilization. Usually agrees with the total-margin objective; if it diverges, capacity is being kept full for strategic reasons.
  • Risk-adjusted margin (margin under bad scenarios): protect margin under demand uncertainty โ€” needs a stochastic or robust extension.

If multi-objective: either weighted sum (total margin + customer-priority weight), or hierarchical (strategic-customer fulfilment first, then total margin).

Academic references

Listed in the sources field at the top of the page.

Sources

  • Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press. Canonical reference for LP; first wide publication of the simplex algorithm.
  • Hillier, F. S. and Lieberman, G. J. (2014). Introduction to Operations Research (10th edition). McGraw-Hill. Standard textbook presentation of product-mix LP with numerical examples.
  • Winston, W. L. (2003). Operations Research: Applications and Algorithms (4th edition). Duxbury. Industry examples of product mix and sensitivity analysis.
  • Taha, H. A. (2017). Operations Research: An Introduction (10th edition). Pearson. LP, simplex, product-mix applications.
  • Goldratt, E. M. (1984). The Goal. North River Press. Theory of constraints; the margin-per-bottleneck-resource concept.
  • Bertsimas, D. and Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35-53. Robust LP framework under uncertainty.
  • Council of Higher Education Thesis Centre (Turkey) โ€” search ‘product mix’ or ’linear programming’ or ‘capacity allocation’ โ€” 50+ theses. tez.yok.gov.tr

Glossary

Linear Programming (LP)
The mathematical-programming discipline that optimizes a linear objective function subject to linear equality and inequality constraints, foundational to operations research.
Product Mix Problem
A classical linear-programming problem in which a manufacturer producing several products from a shared pool of capacity and raw material decides how much of each product to make over a short horizon, maximizing profit or contribution margin.
Shadow Price
In a linear-programming problem, the marginal change in the objective value caused by a unit increase in the right-hand side of a binding constraint; equivalently, the optimal value of the corresponding dual variable.
Was this helpful?
Suggest correction

Related problems

A New Part Order Arrives โ€” How Do I Get the Optimal Operation Sequence + Machine Choice + Setup?

If you are an SMB CNC manufacturer, tooling shop or engineering workshop producing 50-500 different parts, every new order puts the same decision in front of you: you take the customer's CAD model and have to work out on which machine, in which order, with which tool and fixture, and in how many setups the part will be made. If you simply write down the first feasible sequence that comes to mind, setup time grows 3-5x and parts that miss tolerance are reworked; finding the right sequence means comparing several alternative routings for the same part. When the decision lives only in one engineer's head, the similar-part memory walks out of the door when that engineer leaves, and routings of older parts are not refreshed when a new machine is bought. This page is for production-engineering teams who want to make the operation sequence and the machine assignment written and comparable as the bridge from design to make.

Manufacturing 7 min

Backward from the Customer Order โ€” Which Raw Material, When, and How Much Should I Order?

For mid-size manufacturing SMBs running 50-500 end items and 200-2,000 raw materials and sub-components (automotive Tier-2, white-goods component shops, furniture and assembly, machinery). With each product's parts list (BOM) and each part's procurement or production lead time on file, the question is: a customer orders 200 units of product X with a fixed delivery week โ€” which raw materials in what quantity must be ordered which week, and which sub-parts must enter assembly when? Material requirements planning (academic name MRP) answers this question backwards from the delivery date and is the core logic underneath every ERP. Done on paper or by 'my supplier always takes 3 weeks' rules of thumb, you either run out and stop the line, or burn cash on excess stock.

Manufacturing 8 min

Five Suppliers Quote the Same Part โ€” How Much Do I Buy from Each?

You run a manufacturer with 20-200 staff and buy the same raw material or component from 4-8 different suppliers. Each supplier differs on price, quality, lead time, capacity, payment terms, and financial stability; deciding who stays on the approved list and how much of each order goes to whom are two separate calls. A wrong pick can trigger a months-long quality crisis or stop the line when a single supplier fails; the 'cheapest bid wins' approach hides quality, late-delivery, and compliance costs and ends up 15-40% more expensive. Scoring 5-15 bids across 8-12 criteria by hand in a spreadsheet becomes inconsistent fast.

Manufacturing 4 min
Esc Close