Scribd
Upload
7 views4 pages

Day 1

Linear programming (LPP) is a technique for optimizing schedules with limited resources, defined by an objective function and constraints. The feasible region is the area satisfying all constraints, while optimal feasible solutions maximize or minimize the objective function. The document includes examples of LPP problems related to maximizing profits and minimizing costs under various constraints.

Uploaded by

mohan7569yadav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views4 pages

Day 1

Linear programming (LPP) is a technique for optimizing schedules with limited resources, defined by an objective function and constraints. The feasible region is the area satisfying all constraints, while optimal feasible solutions maximize or minimize the objective function. The document includes examples of LPP problems related to maximizing profits and minimizing costs under various constraints.

Uploaded by

mohan7569yadav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Linear Programming Model

Definition of linear programming (LPP)


It is a technique used for optimizing the schedule with the limited availability of
resources.
Objective function:
A linear function
Z=p x + q y,
Where p and q are constants
Whose value is either to be maximized or minimized,is known as objective
function.
Constraints:
The linear is equations or inequalities on the variables of the linear
programming problem (LPP) are called constraints.
The conditions where x > 0, are called non-negative restrictions.
Optimal Value:
Every objective function has a maximum value or minimum value.So, the value
of objective function is names as its optimal value.
Optimization Problem:
A problem which is about maximizing or minimizing a linear function subject to
set of constraints,as determined by a set of linear inequalities,is called an
optimization problem.
Feasible region:
A common region which is found by all constraints including non0negative
constraints of LLP is known as a feasible region.The feasible region is also
referred to as convex polygon
While, the region apart from the feasible region is known as infeasible region.
Feasible solutions:
A feasible solution refers to a solution that satisfies all the constraints or
requirements of a given problem. In the context of optimization or decision-
making problems, a feasible solution meets all the conditions set by the
problem's constraints (such as limits on resources, time, or other factors).
Optimal Feasible Solution:
An optimal feasible solution refers to a solution that not only satisfies all the
constraints of the problem (making it feasible) but also provides the best
possible outcome according to the objective function.
Bounded and Unbounded Region:
If a feasible region of a linear inequality is enclosed within a circle then it’s a
bounded region otherwise it is an unbounded region.
PROBLEMS
1)
Let ‘x’ denote the no of chairs
Let ‘y’ denote the no of tables
Maximize z=200x+400y
Subject to
X+y<48
50x+90y<3000
x>0,y>0
2)
A firm manufactures two types of products A and B and sells them at a profit of
Rs.2 on type A and RS.3 on type B.Each product is processed on two machines
G and H.Type A requires one Hour of processing time on G and two hours on
H:type B requires one hours G and One hour on H.The machine G is available
for not more than 6 hour 40 minutes while machine H is available for 10 hours
during any working day Formulate as a LPP to maximize the profit.
Maximize z=2x+3y
Subject to x+y<6.40
2x+1y<10
X>0,y>0

3)
A company produces two types of Hats. Each hat of the first type requires twice
as much labour time as the second type. If all hats are of the second type only,
the company can produce a total of 500 hats a day. The market limits daily
sales of the first and second type to 150 and 250 hats. Assuming that the
profits per hats are Rs 8 and Rs. 5 for hat A and B respectively.
Formulate the problem as a linear programming model in order to determine
the number of hats to be produce of each type so as to maximize the profits.
Let ‘x’ denote no of type a hats
Let ‘y’ denote the no of type ‘B’ hats
Each type A hat requires twice as much labour as type B.
The total production capacity is 500 hats in terms of type B equivalent.
2x+y<500
The market limits daily sales to most 150 hats of type A:
X<150
The market limits daily sales to at most 250 hats of type B:
Y<250
Non negative Constraints
x>0,y>0
DAY-2
4)
Vishal Consumes two types of Food,A & B Every day to obtain minimum 8 units
of protein,12 units carbohydrates and 9 units of fat which is his daily
requirements,1kg of food A contains 2,6,1 units of protein,carbohydrates and
fats respectively 1kg of food B contains 1,1, & 3 units of P,C & F
respectively.Foods cost 8 per kg and food B cost 5 per kg.Form an LPP to find
how many kg of each food should he buy daily to minimize his cost of food &
still meet minimal nutritional requirements.
Let X denote no of units of food ‘A’
Let Y denote no of units of food ‘B’
Minimize z=8x+5y
Subject to
2x+y>8
6x+y>12
X+3y>9
X,y>0
LPP Graphical Method
When it is > it should be shaded above the line.
When it is < it should be shaded below the line.
Solve the following LPP

You might also like