NAME:- JASON RICHARDS

GROUP:- MPC

A CADEMIC YEAR:- 2024-2025

INDEX NO:-
 ACKNOWLEDGEMENT

I would like to express my special

thanks of gratitude to my Mathematics teacher
“Miss Annapurna” for their able guidance and
support in completing my project.

I would also like to extend my gratitude to

the Principal ma’am “Miss Rebecca Williamson”
for providing me with all the facility that was
required.

Jason Richards V.S.

XII ‘B’
 P ROJECT II

L INEAR PROGRAMMING
PROBLEMS
 AIM:-

EXPLORING LINEAR PROGRAMMING

PROBLEMS
 INTRODUCTION

Linear programming (LP) or Linear

Optimization may be defined as the problem of
maximizing or minimizing a linear function that
is subjected to linear inequalities. The
optimization problems involve the calculation of
profit and loss. Linear programming problems are
an important class of optimization problems, that
helps to find the feasible region and optimize 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.
HISTORY OF LPP:-

The problem of solving a system of linear

inequalities dates back at least as far as Fourier, who
in 1827 published a method for solving them, and after
whom the method of Fourier–Motzkin elimination is
named. In the late 1930s, Soviet mathematician Leonid
Kantorovich and American economist Wassily
Leontief independently delved into the practical
applications of linear programming. Kantorovich
focused on manufacturing schedules, while Leontief
explored economic applications.
The turning point came during World War II
when linear programming emerged as a vital tool. It
found extensive use in addressing complex wartime
challenges, including transportation logistics,
scheduling, and resource allocation. Linear
programming proved invaluable in optimizing these
processes while considering critical constraints such as
costs and resource availability.
The linear programming problem was first
shown to be solvable in polynomial time by Leonid
Khachiyan in 1979 but a larger theoretical and
practical breakthrough in the field came in 1984
when Narendra Karmarkar introduced a new interior-
point method for solving linear-programming problems.
L INEAR P ROGRAMMING P ROBLEMS [LPP]:-

Linear Programming is a method of solving

problems in which a quantity represented a
linear equation, often profit or cost, is to be
maximized or minimized subject to condition
expressed by a system of linear inequalities.

Characteristics :-
Objectives can be expressed in a standard form.
maximize/minimize(Z)=f(x) where ‘Z’ is the objective
function.
Constraints are capable of being expressed in the
form of equality of inequality like (=k)or(<=k)or(>=k)
where k is a constant, and x>=0. Resources to be
optimized are capable of being quantified in
numerical terms. The variables are linearly related
to each other. More than one solution exist, the
objectives being to select the optimum solutions. The
linear programming technique is based on
simultaneous solutions of linear equations
 TERMINOLOGY

• Objective function- The linear function

ax+by+c whose maximum or minimum value
is determined is called the objective function.
The objective function is generally
represented by Z.

• Decision variables- They are the variables x,

and y, which decide the output of the linear
programming problem and represent the final
solution. Relation among these variables should be
linear.

• Constraints- The system of inequations or

equations involving the variables of a LPP
which describe the conditions under which
the optimization is to be attained are called
constraints. The constraints in a LP problem
involve the signs <=,=,>=.

• Non-negative Restrictions - These are the

constraints which imply that the variables
involved in a LPP are non-negative.
• Convex region- A region is said to be
convex if whenever you choose any two points
in the region and draw the segment joining
them, the segment is contained in the region.
For example, the shaded region in Fig. (i) is
convex, while the shaded region in Fig. (ii) is
not

• Feasible region and Feasible solution-

The common region determined by all the
constraints of an LPP is called a feasible
region and every point in this region is called
a feasible solution to LPP. The feasible region
is always a convex set.

• Infeasible solution- A solution of an LPP is

an infeasible solution, if the system of
constraints has no point which satisfies all the
constraints and non-negativity restrictions.

• Optimal feasible solution- A feasible solution

of an LPP is said to be an optimal feasible
solution, if it also optimizes (maximizes or
minimizes) the objective function.
 A PPLICATION OF LPP:-

The primary reason for using linear programming

methodology is to ensure that limited resources are
utilized to the fullest intend without any waste and
that utilization is made in such a way that the
outcomes are expected to be the best possible.

Some of the examples of linear programming are:

• Production Planning:
A company must allocate limited resources
(such as labor, raw materials, and machine
time) to produce different products. The goal is
to maximize profit while adhering to
constraints like production capacity and
demand1.
• Supply Chain Management:
Distributors need to determine the most cost-
effective way to transport goods from suppliers
to consumers. LP helps optimize transportation
routes, minimizing costs while meeting demand
and capacity constraints.
• Resource Allocation:
Airlines allocate flight crew, aircraft, and gates to
maximize revenue while adhering to crew
availability, aircraft maintenance, and airport
capacity constraints.

• Portfolio Optimization:
Investors aim to maximize returns while
managing risk. LP models can allocate funds
across different assets (stocks, bonds, etc.) to
achieve optimal portfolio diversification.

• Manufacturing and Design:

Engineers use LP to optimize designs (e.g., airfoil
shapes) by minimizing drag coefficients while
satisfying constraints like lift coefficients and
maximum thickness2.
 S TEPS FOR F ORMULATING AND
S OLVING LPP:-

We should follow the following steps while solving a

linear programming problem graphically.

Step 1 :- Define the Variables

Identify and define the decision variables that

represent the quantities which is to be optimized.

Step 2 :- Formulate the Objective Function

Determine the objective function, which is a linear

equation that needs to be maximized or minimized.
This function represents the goal of the problem
(e.g., profit, cost).

Step 3 :- Set Up the Constraints:

Identify the constraints, which are linear

inequalities or equations that limit the values of the
decision variables. These constraints reflect the
limitations or requirements of the problem (e.g.,
resource availability).
Step 4 :- Construct the Feasible Region:

Graphically (for two-variable problems) or algebraically

(for more variables), determine the feasible region that
satisfies all constraints. The feasible region is the set of
all possible solutions that meet the constraints.

Step 5 :- Find the Optimal Solution:

• Graphical Method (for two variables):-

Plot the constraints on a graph to define the feasible

region.
Identify the vertices (corner points) of the feasible
region.
Evaluate the objective function at each vertex to find
the maximum or minimum value.

• Simplex Method (for more variables):-

Convert the problem into standard form (with all

constraints in equality form and non-negative
variables).
Set up the initial simplex tableau and perform pivot
operations to iterate towards the optimal solution.
Continue until no further improvement in the objective
function is possible.
Step 6 :- Verify the Solution:
Ensure that the solution obtained is within the
feasible region and satisfies all the constraints.
Check that it is indeed the optimal solution by
comparing it against other feasible solutions if
necessary.

Step 7:- Interpret the Results:

Translate the optimal values of the decision
variables back into the context of the original
problem. Provide recommendations or decisions
based on the solution.
 ILLUSTRATIONS:-

A diet is to contain at least 80 units of vitamin A and 100 units of

minerals. Two foods F₁and F₂are available. Food F₁costs Rs 4 per
unit food and F₂costs Rs 6 per unit. One unit of food F₁contains 3
units of vitamin A and 4 units of minerals. One unit of food F2
contains 6 units of vitamin A and 3 units of minerals. Formulate
this as a linear programming problem. Find the minimum cost for
diet that consists of mixture of these two foods and also meets the
minimal nutritional requirements? Solve this linear program
graphically.
Solution:-
Vitamin A Minerals Cost per
(units) (units) unit (Rs)
Food F1 (x) 3 4 4
Food F2 (y) 6 3 6
Requirement 80 100

Let the number of units of F1 be x

Let the number of units of F1 be y
Objective Function
Z = 4x+5y is the cost to be minimized
Constraints
3x+6y >= 80
4x+3y >= 100
2. A company is involved in the production of two items (X and
Y). The resources need to produce X and Y are twofold, namely
machine time for automatic processing and craftsman time for
hand finishing. The table below gives the number of minutes
required for each item:

Machine time Craftsman time

Item X 13 20
Y 19 29

The company has 40 hours of machine time available in the next

working week but only 35 hours of craftsman time. Machine time
is costed at £10 per hour worked and craftsman time is costed at
£2 per hour worked. Both machine and craftsman idle times
incur no costs. The revenue received for each item produced (all
production is sold) is £20 for X and £30 for Y. The company has a
specific contract to produce 10 items of X per week for a
particular customer.

 Formulate the problem of deciding how much to produce

per week as a linear program.
 Solve this linear program graphically.

Solution:-

Let

 x be the number of items of X

 y be the number of items of Y
 objective function:-
 Z = 20x + 30y - 10(machine time worked) - 2(craftsman time
worked) to be maximized.

subject to:

 13x + 19y <= 2400

 20x + 29y <= 2100
 x >= 10
 x,y >= 0

Solving simultaneously,we have that x=10 and y=65.52 with the

value of the objective function being £1866.5.

maximum occurs at the intersection of x=10 and 20x + 29y <=

2100.
 3. A carpenter makes tables and chairs. Each table can be sold
for a profit of £30 and each chair for a profit of £10. The
carpenter can afford to spend up to 40 hours per week working
and takes six hours to make a table and three hours to make a
chair. Customer demand requires that he makes at least three
times as many chairs as tables. Tables take up four times as
much storage space as chairs and there is room for at most four
tables each week.

Formulate this problem as a linear programming problem and

solve it graphically.
Solution

Variables

Let

xT = number of tables made per week

xC = number of chairs made per week

Objective function:-

Z = 30 Xt + 10 Xc is the profit to be maximized.

Constraints:

 total work time

6xT + 3xC <= 40

 customer demand

xC >= 3xT
 storage space

(xC/4) + xT <= 4

 Xt,Xc >= 0
The graphical representation of the problem is given below and from that we
have that the solution lies at the intersection of

(xC/4) + xT = 4 and 6xT + 3xC = 40

Solving these two equations simultaneously we get xC = 10.667, xT = 1.333 and

the corresponding profit = £146.667
 C ONCLUSION

Linear programming proves to be an

exceptionally useful tool in mathematics and real-
world applications. By allowing us to optimize a
linear objective function while adhering to a set of
linear constraints, it provides a systematic approach
to decision-making in complex scenarios. Its utility
spans various fields, including business, economics,
and engineering. For instance, in business, it helps
in maximizing profit or minimizing costs by
efficiently allocating resources. In logistics, it
optimizes supply chain operations to reduce costs
and improve efficiency. Moreover, linear
programming assists in solving practical problems
where constraints and objectives can be quantified
linearly, enabling more effective and informed
decisions. Overall, the ability to model and solve
optimization problems makes linear programming
an invaluable technique in both theoretical and
applied mathematics.
 BIBLIOGRAPHY

https://www.geeksforgeeks.org

Isc Mathematics class XII (SK Gupta,OP

Malhotra)

https://www.byjus.com

https://www.cuemath.com