We can solve this mathematical linear programming

problem using the method.

At first let's assume that the 2 food items be, Wheat
and Arhar dal or pigeon peas.
The rate of Wheat is Rs. 20 per kg and the rate of
Arhar dal is Rs. 100 per kg.
So, we need to minimize the 100x+20y.
We know protein in Arhar dal is 220gm / kg and in
wheat 100gm/kg.
Carbohydrate in Arhar dal is 630gm / kg and in
wheat 760gm/kg.
Suppose the dietary requirements of adolescent
students are as below,
The requirement for protein is 60gm
Carbohydrate is 1500gm.
So we can formulate our corresponding linear
programming problem as follows,
Z minimize =100x+20y
Constrains are-
220x+100y≥60
630x+760y≥1500 and x,y≥0 .
Hence, the answers are as follows- The two food
items including one pulse and one cereal are Wheat
and Arhar dal/ pigeon peas. The Arhar dal is
Rs.100/kg and wheat is Rs. 20/kg. The linear
programming problem is - Z minimize =100x+20y,
Constrains are- 220x+100y ≥ 60 .
630x+760y≥1500 and x,y ≥0 .
 Introduction
In Mathematics, linear programming is a method of
optimising operations with some constraints. The
main objective of linear programming is to maximize
or minimize the numerical value. It consists of linear
functions which are subjected to the constraints in
the form of linear equations or in the form of
inequalities. Linear programming is considered an
important technique that is used to find the optimum
resource utilisation. The term “linear programming”
consists of two words as linear and programming.
The word “linear” defines the relationship between
multiple variables with degree one. The word
“programming” defines the process of selecting the
best solution from various alternatives.
Linear Programming is widely used in Mathematics
and some other fields such as economics, business,
telecommunication, and manufacturing fields. In this
article, let us discuss the definition of linear
programming, its components, and different
methods to solve linear programming problems.

What is Linear Programming?

Linear programming (LP) or Linear
Optimisation may be defined as the problem of
maximizing or minimizing a linear function that is
subjected to linear constraints. The constraints may
be equalities or inequalities. The optimisation
problems involve the calculation of profit and
loss. Linear programming problems are an
important class of optimisation problems, that helps
to find the feasible region and optimise the solution
in order to have the highest or lowest value of the
function.
In other words, linear programming is considered as
an optimization method to maximize or minimize the
objective function of the given mathematical model
with the set of some requirements which are
represented in the linear relationship. The main aim
of the linear programming problem is to find the
optimal solution.
Linear programming is the method of considering
different inequalities relevant to a situation and
calculating the best value that is required to be
obtained in those conditions. Some of the
assumptions taken while working with linear
programming are:
• The number of constraints should be expressed
in the quantitative terms
• The relationship between the constraints and the
objective function should be linear
 • The linear function (i.e., objective function) is to
be optimised

Components of Linear Programming

The basic components of the LP are as follows:
• Decision Variables
• Constraints
• Data
• Objective Functions
Characteristics of Linear Programming
The following are the five characteristics of the linear
programming problem:
Constraints – The limitations should be expressed
in the mathematical form, regarding the resource.
Objective Function – In a problem, the objective
function should be specified in a quantitative way.
Linearity – The relationship between two or more
variables in the function must be linear. It means
that the degree of the variable is one.
Finiteness – There should be finite and infinite
input and output numbers. In case, if the function
has infinite factors, the optimal solution is not
feasible.
Non-negativity – The variable value should be
positive or zero. It should not be a negative value.
Decision Variables – The decision variable will
decide the output. It gives the ultimate solution of the
problem. For any problem, the first step is to identify
the decision variables.

Linear Programming Problems

The Linear Programming Problems (LPP) is a
problem that is concerned with finding the optimal
value of the given linear function. The optimal value
can be either maximum value or minimum value.
Here, the given linear function is considered an
objective function. The objective function can
contain several variables, which are subjected to the
conditions and it has to satisfy the set of linear
inequalities called linear constraints. The linear
programming problems can be used to get the
optimal solution for the following scenarios, such as
manufacturing problems, diet problems,
transportation problems, allocation problems and so
on.
Methods to Solve Linear Programming Problems
The linear programming problem can be solved
using different methods, such as the graphical
method, simplex method, or by using tools such as
R, open solver etc. Here, we will discuss the two
most important techniques called the simplex
method and graphical method in detail.
Linear Programming Simplex Method
The simplex method is one of the most popular
methods to solve linear programming problems. It is
an iterative process to get the feasible optimal
solution. In this method, the value of the basic
variable keeps transforming to obtain the maximum
value for the objective function. The algorithm for
linear programming simplex method is provided
below:
Step 1: Establish a given problem. (i.e.,) write the
inequality constraints and objective function.
Step 2: Convert the given inequalities to equations
by adding the slack variable to each inequality
expression.
Step 3: Create the initial simplex tableau. Write the
objective function at the bottom row. Here, each
inequality constraint appears in its own row. Now,
we can represent the problem in the form of an
augmented matrix, which is called the initial simplex
tableau.
Step 4: Identify the greatest negative entry in the
bottom row, which helps to identify the pivot column.
The greatest negative entry in the bottom row
defines the largest coefficient in the objective
function, which will help us to increase the value of
the objective function as fastest as possible.
Step 5: Compute the quotients. To calculate the
quotient, we need to divide the entries in the far right
column by the entries in the first column, excluding
the bottom row. The smallest quotient identifies the
row. The row identified in this step and the element
identified in the step will be taken as the pivot
element.
Step 6: Carry out pivoting to make all other entries
in column is zero.
Step 7: If there are no negative entries in the bottom
row, end the process. Otherwise, start from step 4.
Step 8: Finally, determine the solution associated
with the final simplex tableau.