Scribd
Upload
254 views8 pages

Linear Programming Problem: Ajay Kumar Sinha

The document discusses linear programming problems (LPP), which involve optimizing resources with decision variables that are linearly related to dependent variables. An example LPP problem is presented about a manufacturing company that must determine the optimal production levels of two products given constraints on grinding and polishing time and the objective of maximizing profit. The LPP is formulated mathematically and graphically and the optimal solution is calculated as producing 3 units of product A and 1 unit of product B for a maximum profit of Rs. 9.

Uploaded by

mdneyazah
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
254 views8 pages

Linear Programming Problem: Ajay Kumar Sinha

The document discusses linear programming problems (LPP), which involve optimizing resources with decision variables that are linearly related to dependent variables. An example LPP problem is presented about a manufacturing company that must determine the optimal production levels of two products given constraints on grinding and polishing time and the objective of maximizing profit. The LPP is formulated mathematically and graphically and the optimal solution is calculated as producing 3 units of product A and 1 unit of product B for a maximum profit of Rs. 9.

Uploaded by

mdneyazah
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 8

Linear Programming Problem

AJAY KUMAR SINHA


LPP: Linear Programming Problem
Defn: It is a mathematical modeling technique
where the decision variables are in linear
relationship with dependent variables and the
main objective is to optimize the resources
utilized.

Example: z = 2x1 + 3x2


Here,
x1 & x2 are decision variables
z is a dependent variable
Features
Optimization technique
- cost minimization
- profit maximization

Example1: A manufacturing company producing two types


of product ie., A and B with limited resources. Product A
requires 3 hrs for grinding and 6 hrs for polishing while
product B requires 6 hrs for grinding and 3 hrs for
polishing. The total time available for grinding and
polishing operations are 12 hrs and 18 hrs respectively.
The selling price of product A is Rs. 2/unit and for B is
Rs. 3/unit. Find the total units of each product that a
company should manufacture for its maximum profit.
Tabular form
Product A Product B Total hrs
hrs hrs Available
Grinding 3 6 12

Polishing 6 3 18

Selling Rs. 2 Rs. 3


Price/unit
LPP Formulation
• Objective function:
Maximization of Profit
ie.,
Max. Z = 2x1 + 3x2

Where;
x1 & x2 are number of items of A and B
Constraint formulation
• Subjected to constraints;

3x1+ 6x2 ≤ 12
6x1+ 3x2 ≤ 18
x1 > 0
x2 > 0
x2

6
Graphical plot
5

A
(0,2)
2

B (8/3,2/3)
1

O 1 2 3 4 5 6 x1
(0,0)
C (3,0)
Solution
X1 = 8/3 = 2.70 ≈ 3 units
X2 = 2/3 = 0.67 ≈ 1 unit

Max z = 2 (3) + 3 (1)


=6+3
=9

Max. Profit is Rs. 9

You might also like