∇ProvenDecisions
Ctrl K

Blending problem: a linear programming example, solved and checked

The blending problem is a classic linear programming problem. Here it is solved by a real solver (HIGHS) and checked: every constraint, the dual, and the optimality certificate. Change the numbers below and solve your own.

Answer. The smallest objective value is 216.667, at x1 = 0.333333, x2 = 0.333333, x3 = 0.333333. All 6 constraints are satisfied exactly. Exactly proven optimal.

Solve your own version free, no account needed

The problem

Blend three grains into 1 tonne of feed at least 12% protein and at most 5% fibre. Grain 1: $200/t, 10% protein, 3% fibre. Grain 2: $300/t, 18% protein, 4% fibre. Grain 3: $150/t, 8% protein, 8% fibre. Minimize cost.

How the model was built

The objective as written from the problem, before the numbers are multiplied out:

The model

Each line has a plain-language note on the right.

make this as small as possible
limit 1: left side must equal 1
limit 2: left side must reach at least 0.12
limit 3: left side cannot exceed 0.05
tonnes of grain 1 in the blend (t) cannot be negative
tonnes of grain 2 in the blend (t) cannot be negative
tonnes of grain 3 in the blend (t) cannot be negative

In matrix form

With its numbers:

What is being decided

There are 3 decision variables.

VariableTypeMeaning
x1real numbertonnes of grain 1 in the blend (t)
x2real numbertonnes of grain 2 in the blend (t)
x3real numbertonnes of grain 3 in the blend (t)

Goal and limits

Minimize the objective subject to 6 constraints, of which 3 are simple bounds on a single variable.

Problem type

LP, complexity level 1: a small linear program. Solved with HIGHS at the Medium solver tier.

The answer at a glance

The optimal value of each decision, as the solver returned it.

x10.333333x20.333333x30.333333

Which constraints hold the answer in place

Binding (no slack left): (1) x1 + x2 + x3 = 1; (2) 0.1*x1 + 0.18*x2 + 0.08*x3 >= 0.12; (3) 0.03*x1 + 0.04*x2 + 0.08*x3 <= 0.05. Changing a binding constraint changes the answer; a slack one can move a little without effect.

#ConstraintValueLimitSlackBinding
1x1 + x2 + x3 = 1110yes
20.1*x1 + 0.18*x2 + 0.08*x3 >= 0.120.120.120yes
30.03*x1 + 0.04*x2 + 0.08*x3 <= 0.050.050.050yes
4x1 >= 00.33333300.333333
5x2 >= 00.33333300.333333
6x3 >= 00.33333300.333333

Why this is optimal

A proof you can check by hand. Multiply each constraint in the table by its weight and add them up: the result is a lower limit on the objective that holds for every plan meeting the constraints. Our answer reaches that limit exactly, so no plan does better. A negative weight turns a limit around (for example ≥ into ≤) before adding. Every step was checked in exact fractions, not rounded decimals.

#ConstraintWeight
1x1 + x2 + x3 = 1250/3
20.1·x1 + 0.18·x2 + 0.08·x3 ≥ 0.1227500/21
30.03·x1 + 0.04·x2 + 0.08·x3 ≤ 0.05-10000/21

Algebraic model (low level)

Decision variables, objective and every constraint written out; this is exactly what the solver receives.

Standard form

As a linear program: minimize cᵀx subject to A x ≤ b (the inequality rows) and A_eq x = b_eq (the equations); a maximization is written as minimizing the negative.

Model code (cvxpy)

The same model in cvxpy, ready to run.

import cvxpy as cp

x1 = cp.Variable(name='x1')  # tonnes of grain 1 in the blend (t)
x2 = cp.Variable(name='x2')  # tonnes of grain 2 in the blend (t)
x3 = cp.Variable(name='x3')  # tonnes of grain 3 in the blend (t)

objective = cp.Minimize(200*x1 + 300*x2 + 150*x3)
constraints = [
    x1 + x2 + x3 == 1,
    0.1*x1 + 0.18*x2 + 0.08*x3 >= 0.120000000000000,
    0.03*x1 + 0.04*x2 + 0.08*x3 <= 0.0500000000000000,
    x1 >= 0,
    x2 >= 0,
    x3 >= 0,
]
problem = cp.Problem(objective, constraints)
problem.solve(solver='HIGHS')
print(problem.status, problem.value)
print('x1 =', x1.value)
print('x2 =', x2.value)
print('x3 =', x3.value)

The dual problem

Every constraint of the original (primal) problem gets a price, and every primal variable becomes a constraint on those prices. Strong duality: primal and dual optima are equal (216.667).

Dual variablePricesValue
y1price of constraint 'x1 + x2 + x3 = 1' (objective change per extra unit of its right-hand side)83.3333
y2price of constraint '0.1*x1 + 0.18*x2 + 0.08*x3 >= 0.12' (objective change per extra unit of its right-hand side)1309.52
y3price of constraint '0.03*x1 + 0.04*x2 + 0.08*x3 <= 0.05' (objective change per extra unit of its right-hand side)-476.19

Solve your own

This is the model as the app reads it. Change any number and solve it in the free box on the front page (no account needed).

minimize 200 x1 + 300 x2 + 150 x3
subject to
x1 + x2 + x3 = 1
0.10 x1 + 0.18 x2 + 0.08 x3 >= 0.12
0.03 x1 + 0.04 x2 + 0.08 x3 <= 0.05
x1, x2, x3 >= 0
# x1 = tonnes of grain 1 in the blend (t)
# x2 = tonnes of grain 2 in the blend (t)
# x3 = tonnes of grain 3 in the blend (t)

Change the numbers and solve it

Checked: the app's answer matches the reference answer in our test set, which two solvers (HIGHS, CLARABEL) agree on. Built 2026-11-10.

Related examples

All 50 solved examples

Try ProvenDecisions free: type, photograph or say an optimization problem; every answer is checked by a solver.

What do you want to optimize?

Type the math, describe it in words, snap a photo or say it. ProvenDecisions builds the model, solves it, checks it and walks you through it.

One constraint per line, or separated by commas. Add integer: x, y or binary: z for whole-number decisions. LaTeX works too.

Try: