OPTIMIZATION

PROBLEMS
USING LINEAR
PROGRAMMING
Analyzing Real-World Situations and
Presenting Optimized Solutions

Submitted By: Sai Sachin

Dhotre
Class: 12th
 ACKNOWLEDGEMENT
I would like to express my profound gratitude to my Mathematics teacher, for their
invaluable guidance, encouragement, and support throughout the completion of this
project. Their expertise and insightful suggestions have been instrumental in shaping
this project and enhancing my understanding of the subject.I am also deeply thankful to
the Principal of DSP INTERNATIONAL SCHOOL, for providing an environment that
fosters learning and exploration.I extend my heartfelt appreciation to my parents and
family members for their unwavering support and encouragement, which motivated me
to strive for excellence. Their patience and belief in my abilities have been a constant
source of strength.
CONTENT Pg
No.
Introduction
1
INDEX
Project Work
Problem Statement
2
Mathematical Formulation
3,4
Solution and Analysis
5,6
Conclusion
7
 INTRODUCTION
Linear programming is a mathematical technique used for optimizing a given
objective function, subject to certain constraints. It has vast applications in
real-world problems, such as resource allocation, supply chain management,
and delivery route optimization.

In this project, I will analyze a real-world scenario involving [e.g., delivery

routes or resource allocation]. Using linear programming, I aim to find an
optimal solution that minimizes costs or maximizes efficiency. The project
also includes a visual representation of the results for better understanding.
 1. PROBLEM STATEMENT
Optimization problems are prevalent in various industries, from transportation and
logistics to manufacturing and resource management. This project focuses on optimizing
[e.g., delivery routes for a courier service, resource allocation in a factory, or
production scheduling in a manufacturing unit].
The primary objective is to [e.g., minimize the total transportation cost, reduce
delivery times, or maximize production output]. The problem is subject to several
constraints, such as:
•Limited availability of resources (e.g., vehicles, drivers, or
raw materials).
•Time restrictions (e.g., delivery deadlines or production
schedules).
•Capacity limitations (e.g., vehicle weight limits or storage
capacities).
 2. MATHEMATICAL
FORMULATION
 Linear programming is used to model the problem mathematically. This involves the following
components:
 (a) Decision Variables:
These represent the quantities we need to determine to achieve the objective. For example:
• ,​,…...: The number of items allocated to different tasks or the number of routes chosen.
 (b) Objective Function:
This is the function to be optimized (minimized or maximized). For example:
• Minimize transportation cost:
Z = ………..
where ………..​are the costs associated with each decision variable.
 (c) Constraints:
The problem is subject to specific limitations, expressed as linear inequalities or equations. Examples:
• Resource constraint:
• Time constraint:
• Non-negativity constraint: ,…,​≥ 0.
Example Problem Formulation:
A company needs to transport goods between two locations
using two available routes. The cost of transportation per unit
via Route 1 and Route 2 is ₹5 and ₹8, respectively. The total
demand is 100 units, and the company can allocate up to 60
units to Route 1 and 70 units to Route 2. The problem is to
minimize transportation costs.
Mathematical model:
Objective Function:
Z=​
Subject to:
 3. SOLUTION AND ANALYSIS
 Linear programming problems can be solved using two primary methods:
 (a) Graphical Method:

• Plot each constraint on a graph.

• Identify the feasible region (intersection of all constraints).
• Determine the optimal solution by evaluating the objective function at the vertices of the
feasible region.
 Example (Graphical Solution):
For the above problem, the constraints can be plotted on a graph. The feasible region is a
polygon, and the solution lies at one of its vertices. Calculating Z at each vertex gives the
minimum transportation cost.
 (b) Simplex Method:

• For problems involving more than two variables, the simplex algorithm is used.
• It systematically evaluates corner points in higher dimensions to find the optimal solution.
 Analysis:
The optimal solution for the example problem could be , resulting in Z=₹520. This means the
company should transport 60 units via Route 1 and 40 units via Route 2 to minimize costs.
 4. SENSITIVITY ANALYSIS
 After finding the optimal solution, sensitivity analysis can help

determine:

• How changes in costs (coefficients of the objective function) affect the

solution.

• How varying constraints (e.g., increasing Route 1’s capacity) impacts

the feasibility and optimality.

 For example:

• If the cost for Route 1 changes to ₹6 per unit, the new objective

function becomes ​. The problem can be resolved to see if the solution

 SOLUTION
Vertex Calculation Z
(0,0) 0 0 Z=6(0)+8(0) 0
(60,0) 60 0 Z=6(60)+8(0) 360
(60,40) 60 40 Z=6(60)+8(40) 680
(0,70) 0 70 Z=6(0)+8(70) 560

The smallest Z value occurs at the vertex (60,0) with: 𝑍=360

 CONCLUSION
This investigatory project explored the application of linear programming in solving real-world
optimization problems, focusing on transportation cost minimization. By analyzing a scenario
involving resource allocation across two delivery routes, we formulated the problem
mathematically with an objective function and constraints. The graphical method was utilized
to identify the feasible region and evaluate optimal solutions at its vertices.
Through careful computation, we determined that the optimal allocation minimizes the
transportation cost. Initially, with Route 1 costing ₹5 per unit and Route 2 costing ₹8 per unit,
the minimum cost was ₹520, achieved by allocating 40 units to Route 1 and 60 units to Route
2. When the cost of Route 1 increased to ₹6 per unit, the optimal allocation shifted entirely to
Route 1, with 60 units assigned, reducing the total cost to ₹360.
This project demonstrated the power of linear programming in decision-making and
optimization. Its practical applications in logistics, resource allocation, and other fields make
it a valuable mathematical tool. The process also fostered analytical thinking, problem-
solving skills, and an appreciation for the mathematical modeling of complex situations.
Through this project, we have successfully applied theoretical knowledge to a practical
problem, showcasing how mathematics can contribute to efficiency and cost-effectiveness in
real-world scenarios.
 REFERENCES
 CBSE Mathematics Reference Book for Class XII

 Desmos Graphing Calculator: https://www.desmos.com/calculator

 DALL·E 2 by OpenAI for flowchart creation.

 TutorialsPoint: Linear Programming Overview.

https://www.tutorialspoint.com