Scribd
Upload
19 views

Math Project Class 12

Uploaded by

abhijaya
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
19 views

Math Project Class 12

Uploaded by

abhijaya
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

To formulate a Linear Programming Problem (LPP) and find the optimum cost in a

manufacturing problem using suitable data, we will go through a step-by-step process.

Optimization of Manufacturing Costs Using Linear Programming

By abhijaya s navali
Table of Contents:
1. Introduction
2. Problem Statement
4. Formulation of the LPP
5. Solution (Graphical Method or Simplex Method)
6. Real-Life Interpretation of the Solution
7. Conclusion
8. Bibliography

---
1. Introduction:

In this project, we aim to minimize the manufacturing cost of producing two types of products in
a factory by formulating and solving a Linear Programming Problem (LPP). Manufacturing
companies often need to balance their resources (labor, raw materials, machine hours) to
achieve maximum profitability while minimizing costs. Linear programming is a powerful tool for
finding the most efficient production levels given certain constraints.

Linear Programming (LP) is a mathematical method used to determine the best possible
outcome (such as maximum profit or lowest cost) in a given mathematical model where
requirements are represented by linear relationships. It is a technique used to solve optimization
problems by considering a linear objective function and a set of linear inequalities or equalities
called constraints. But
---
2. Problem Statement

A factory manufactures two products: Product A and Product B. The company wants to
determine how many units of each product to produce to minimize the total manufacturing cost
while satisfying the following constraints:

Objective:Minimize the cost of production.


- The available labor is 150 hours.
- The available machine time is 200 hours.
- The production of Product A requires 1 hour of labor and 2 hours of machine time.
- The production of Product B requires 3 hours of labor and 1 hour of machine time.
- The cost to produce one unit of Product A is ₹100, and for Product B, it is ₹150.

Product Labor Hours per Machine Hours per Cost per Unit (₹)
Unit Unit

A 1 2 100

B 3 1 150

Constraints:
1. The labor available is 150 hours.
2. The machine time available is 200 hours.

We will formulate and solve this as a Linear Programming Problem to minimize the cost.

. Assumptions:
- Each product's labor and machine hours are consistent across all units.
- The factory operates under full efficiency, i.e., all available hours will be used optimally.
- The factory cannot produce a negative number of products, i.e., non-negative constraints
apply.
4. Formulation of the Linear Programming Problem (LPP):
Let:

● x = number of units of Product A produced


● y = number of units of Product B produced

Objective Function (Minimization):


Minimize Z=100x+150y

(Where ₹100 and ₹150 are the costs per unit of Product A and Product B, respectively).

Subject to Constraints:

1. Labor constraint:

1x+3y≤1501x + 3y

(The total labor hours required for production should not exceed 150 hours).

2. Machine time constraint:

2x+1y≤2002x + 1y

(The total machine hours required for production should not exceed 200 hours).

3. Non-negativity constraint:

x≥0, y≥0x

5. Solution:
You can solve the above LPP using either the graphical method (if you are allowed to use it) or
the Simplex method. Below is a brief outline of both methods:

Graphical Method:

1. Plot the constraints on a graph.


2. Identify the feasible region (the area that satisfies all constraints).
3. Determine the vertices (corner points) of the feasible region.
4. Evaluate the objective function Z=100x+150y at each vertex to find the minimum cost.

Simplex Method:

If you solve this algebraically using the Simplex method (use a calculator or software), follow
these steps:

1. Convert inequalities into equalities by introducing slack variables.


2. Set up the initial Simplex tableau.
3. Perform pivot operations to maximize or minimize the objective function.

Not required

Example Vertex Solutions:

1. (0,50) — Evaluate Z=100(0)+150(50)=7500


2. (50,0) — Evaluate Z=100(50)+150(0)=5000Z
3. Intersection of lines 1x+3y=1501x + 3y = 150 and 2x+1y=200: Solving gives x=50,y=50x

Minimum Z will occur at one of these points.

---

6. Real-Life Interpretation of the Solution:


Assume we find that producing 50 units of Product A and 0 units of Product B minimizes the
total cost to ₹5000.

Interpretation:

● This means that to minimize the cost, the factory should focus entirely on producing
Product A, and avoid producing Product B, as it leads to higher costs.
● The constraints ensure that the resources (labor and machine time) are used efficiently
without overuse.
● This solution helps the factory manage its resources, minimize waste, and reduce overall
production costs.

---

7. Conclusion:
Through the formulation and solution of the Linear Programming Problem, we determined the
optimal production strategy that minimizes costs while respecting the given resource
constraints. The LPP approach helps businesses like this factory make data-driven decisions to
enhance productivity and profitability.

In conclusion, conducting this linear programming project provides valuable insights into how
mathematical techniques can be applied to optimize real-world problems, such as minimizing
costs or maximizing profits in manufacturing. By formulating and solving the problem, we learn
how constraints on resources like labor and machine hours influence production decisions. This
project highlights the practical importance of optimization in business, helping organizations
make data-driven decisions to efficiently allocate resources and achieve their objectives.
---

Biblography

You might also like