Linear Programming as a Mathematical Model: The Farm Food-Mix Problem

Businesses constantly need to make decisions that minimise cost while meeting fixed requirements — how much of each raw material to buy, how much of each ingredient to mix, how many units of each product to manufacture. The CBSE Class 11 NCERT Appendix on Mathematical Modelling demonstrates exactly this kind of decision-making using linear programming, applied to a real farm’s animal-feed problem. This post walks through the complete formulation and graphical solution.

The Problem Statement

A farmhouse uses at least 800 kg of a special food daily for its animals. This special food is a mixture of two ingredients — corn and soyabean — with the following nutritional and cost data:

MaterialProtein per KgFibre per KgCost per Kg
Corn0.090.02Rs 10
Soyabean0.600.06Rs 20

The dietary requirements stipulate that the mixture must contain at least 30% protein and at most 5% fibre. The goal is to determine the daily minimum cost of this food mix.

Step 1: Identifying the Variables

The objective is to minimise the total daily cost of the food, which depends on how much corn and soyabean are used. Three variables naturally emerge:

  • x = the amount of corn (in kg)

  • y = the amount of soyabean (in kg)

  • z = the total cost

Step 2: Formulating the Mathematical Model

The cost column of the data table gives a direct relationship between z, x, and y:

z = 10x + 20y … (1)

This is the quantity to be minimised. But z cannot be minimised freely — it is subject to several real-world constraints, each of which must also be translated into mathematical form.

Constraint (a): Minimum Total Food Requirement

The farm needs at least 800 kg of food in total, so:

x + y ≥ 800 … (2)

Constraint (b): Minimum Protein Requirement

The food must contain at least 30% protein, measured as a proportion of the total protein contributed by both ingredients:

0.09x + 0.6y ≥ 0.3(x + y) … (3)

Constraint (c): Maximum Fibre Limit

The food must contain at most 5% fibre:

0.02x + 0.06y ≤ 0.05(x + y) … (4)

Simplifying the Constraints

Grouping the coefficients of x and y in inequalities (2), (3), and (4) and simplifying gives the final mathematical statement of the problem:

Minimise z subject to:

  • x + y ≥ 800

  • 0.21x − 0.30y ≤ 0

  • 0.03x − 0.01y ≥ 0

This set of one objective function and three constraint inequalities is the complete formulation of the linear programming model.

Step 3: Solving the Model Graphically

Linear programming problems with two variables can be solved by plotting each inequality on a graph and identifying the feasible region — the shaded area that satisfies all constraints simultaneously. Each boundary line of this region represents one constraint operating at its limit.

Plotting the three inequalities x + y ≥ 800, 0.21x − 0.30y ≤ 0, and 0.03x − 0.01y ≥ 0 produces a shaded feasible region bounded by three lines. Since the objective is to minimise cost, the optimum solution occurs at a corner point (vertex) of this feasible region — a standard result in linear programming, since the objective function changes linearly across the region and its extreme values always occur at vertices.

Working out the intersection point of the boundary lines gives the optimum solution:

x = 470.6 kg of corn, y = 329.4 kg of soyabean

Step 4: Calculating and Interpreting the Solution

Substituting these optimum values back into the cost equation:

z = 10 × 470.6 + 20 × 329.4 = 4706 + 6588 = Rs 11,294

This is the mathematical solution to the problem. Interpreting it in real-world terms: the minimum daily cost of the special food — while still meeting the required protein and fibre proportions — is Rs 11,294, achieved by using 470.6 kg of corn and 329.4 kg of soyabean each day.

Why This Example Matters

This food-mix problem is a compact but complete illustration of how linear programming works as a mathematical model. It shows all the key ingredients of the technique:

  • An objective function to optimise (minimise cost, in this case)

  • Constraints derived directly from real-world limitations (total quantity, nutrient percentages)

  • A feasible region representing every combination of inputs that satisfies all constraints

  • An optimum point, always found at a vertex of the feasible region for linear objectives

Linear programming of this kind is widely used beyond agriculture — in manufacturing to decide production mixes, in logistics to plan cost-efficient delivery routes, and in finance to allocate investments subject to risk and budget constraints. For Commerce students preparing for exams like CUET, understanding how to convert word problems into inequality systems is a foundational and frequently tested skill.

Keep Learning

Start Practising with ChampionsPrep

Linear programming problems like this one appear frequently in Commerce entrance exams and board applications of mathematics. Register free on ChampionsPrep for AI-powered practice sets, step-by-step graphical solutions, and mock tests built for CBSE and Maharashtra Board Class 11–12 Commerce students — with simple pay-as-you-use pricing.

Test Your Knowledge

Q1.In the farm food-mix problem, what is the objective function to be minimised?
Q2.Which constraint represents the farm’s minimum food requirement?
Q3.Where does the optimum value of a linear objective occur in the feasible region?
Q4.What is the minimum daily cost of the food mix?
Q5.How much soyabean is used in the optimum mix?
Linear Programming as a Mathematical Model: The Farm Food-Mix Problem (Class 11 Maths) podcast artwork
Audio LessonClass 11

Linear Programming as a Mathematical Model: The Farm Food-Mix Problem (Class 11 Maths)

ChampionsPrep MathematicsEpisode 193:00

Subscribe in any podcast app:

Frequently Asked Questions

What is the objective function in the farm food-mix problem? +

The objective function is z = 10x + 20y, representing the total daily cost of corn (x kg) and soyabean (y kg), which the farm wants to minimise.

What are the constraints in this linear programming problem? +

The constraints are x + y ≥ 800 (minimum total food), 0.21x − 0.30y ≤ 0 (minimum 30% protein requirement), and 0.03x − 0.01y ≥ 0 (maximum 5% fibre limit).

What is the minimum cost of the food mix, and how is it achieved? +

The minimum cost is Rs 11,294 per day, achieved using 470.6 kg of corn and 329.4 kg of soyabean.

Why is the optimum solution found at a corner point of the feasible region? +

Because the objective function is linear, its value changes uniformly across the feasible region, so its minimum or maximum value must occur at one of the region's vertices rather than somewhere in the interior.

Where else is linear programming used in real life? +

Linear programming is used in manufacturing to plan optimal production mixes, in logistics to minimise transportation costs, and in finance to allocate budgets or investments subject to constraints.