Linear Programming

→ Linear Programming in generally used in solving maximization (sales or profit

maximization) or minimization (contamination) problem: subject to certain assumptions.
→ Linear Programming in the maximization or minimization of a linear function of variables
subject to a constraint of linear inequalities.
→ Linear Programming is a mathematical technique designed to assisting organization in
optimally allocating its available resources under conditions of certainty in problem of
scheduling, product mix and go on.
→ Feasible solution: Feasible solution are all those possible solutions which can be worked
upon order given constraints. (The regions, comprising all feasible solutions in also referred
as Feasible Region)
→ Optimum solution: Optimum solution is the best of the feasible solutions.
## Fields where Linear Programming can be used.
• L.P. is extensively used in solving resource allocation problems.
• Production, planning & scheduling, transportation, Sales & advertising, financial
planning & scheduling, portfolio analysis, corporate planning etc are the same of the
its most fertile application areas.
More specifically, LP has been successfully applied in the following fields:
• Agricultural applications: L.P. can be applied from high problems like the allocation of
resources such as labour, water supply or working capital in such a way to maximize
net revenue.
• Contract awards: Evaluation & tenues by recourse to linear programming guarantees
that the awards are made in the cheapest way.
• Industrial applications: Applications & L.P. in business & industry are of the most
diverse kind of used to solve the problems of production (production maximization) &
inventory control.
## Basic Questions & Answers.
• What is meant by the term linear programming?
→ Equations which have all variables with exponents of one are called linear equations,
because these equations when graphed, form a straight line. Problem solving based upon
systems of linear equations or linear inequalities is referred to a linear programming.
• Discuss the concept of inequalities & their relationship to equations.
→ Inequalities are mathematical statements that show the relationship between two
expressions where they are not necessarily equal, but one may be greater than or less than
the other. Common inequality symbols include:
 ✓ > (greater than)
✓ < (less than)
✓ ≥ (greater than or equal to)
✓ ≤ (less than or equal to)
✓ ≠ (not equal to)

• What is meant by the term objectives functions?

→ (Only one other)/the relationship need be set forth that relating to asking the objective.
This relationship in usually referred to as the objective functions.
• What is meant by the term restriction?
An inequality with a 'less than’ component is called a restriction.
• What is meant by the term requirement?
→ An inequality with a 'greater than’ component is called a requirement.
• Describe the techniques of graphing a linear programming.
→ Graphing is a fundamental method for solving two-variable linear programming (LP)
problems. It provides a visual representation of feasible solutions and helps identify the
optimal solution. Below are the key steps and techniques involved:
• Formulate the Problem.
• Plot the Constraints.
• Identify the Feasible Region.
• Find Corner Points.
• Evaluate the Objective Function.
## Objectives
1. Classical objective is available to maximize weekly profits. (To maximize profit)
2. Maximum units of production might be the prime objective (to maximize number of
units produced).
3. Maximum utilization of facilities, particularly of employees, could also be of
interest. (To maximize the utilization of man-hours.)
In most linear programming problems, one of the basic requirements is that each of the
variables must not be negative.

T
If,
50
TC= (0,10)
40
TC= (50,0)
30

axis 20

10

10 20 30 40 50 C

axis

Problem: The Oakdale Furniture company specializes in the manufacture of tables and
chairs. Both tables & chairs must be worked in the department I, roughing; Department II,
finishing; & Department III, painting. Department 1 has available 100-man hours per week,
Dept-II has 77, Dept- III has 80.
Each table requires 10-man hours in Department I, 7 in Dept II & 2 in Dept- III. Similarly,
each chair requires 2 hours in Dept- I, 3 hours in Dept- II, & 4 hours in Dept- III. Net profit
in the sales of each table is $12 & on each chair is $3. How many tables & new many chairs
should be manufactured each week.
The following table shows the relationship involved in the problem.
Dept. I Dept. II Dept. III Profit per unit
Tables hour per unit -10 7 2 $12
Chairs hour per unit 2 3 4 $3
Total hours available 100 77 80

In order to write to linear programming model for the problem let us first write to solutions
as under.
LET,
T reported to number of tables 2.
C reported to number of chairs manufactured per week.
Then 10 times T (10T) is the total time spent manufacturing tables in Dept-I; 7T in Dept- II;
& 2T in Dept- III. Similarly, 2c, 3c & 4c represent the time spent making chairs in Dept- I,
II, & III respectively.
Since, dept. 1 has available 100-man hours, the most time that can be spent making both
tables & chairs in Dept-I is-
10T + 2C = 100
There is however, no requirements that Dept- I work its full 100-man hours. It can work less.
That fact is expressed by-
10T + 2C ≤ 100
The situation in Dept- II & III may be similarly expressed.
Dept- II: 7T + 3C ≤ 77
Dept- III: 2T + 4C ≤ 80
The profit per table is equal to $12. Therefore, the total, profit on tables sold is equal to 12
times T or 12T. Similarly, the total profit on chairs equals 3C & total profits= 12T+3C.
The objective to maximize its objectives or to maximize its value.
Total units produced = T+C
This objective function is to be maximized.
To develop its objective function for maximizing its utilization of facilities (in this
illustration the only facilities available are man hours).
The time spent making tables in all three departments is summed-
10T + 7T + 2T = 19T
& The time spent making chairs in all three departments is similarly summed-
2C + 3C + 4C = 9C
The total utilization of facilities is then equal to 19T + 9C.
The following relationship have been developed:
Dept- I: 10T + 2C ≤ 100 ------------- (i)
Dept- II: 7T + 3C ≤ 77 ---------------- (ii)
Dept- III: 2T + 4C ≤ 80 --------------- (iii)
Objective function I: Total profit= 12T + 3C
Objective function II: Total units produced= T + C
Objective function III: Total man hours used= 19T + 9C
& T ≥ 0; C ≥ 0 (non negative condition)
(N.B.: Graphical Solution করতে হতে এরপর Graphical Solution এরপর যেতে হতে )

Finally, multiply equation I by 3 & equation II by 2. Then subtract II from I.

30T + 6C = 300
14T + 6C = 154
- - -
16T = 146
146 73 1
T= = =9
16 8 8
73
Substitute T= in equation I.
8
73
10 × + 2C = 100
8
365
Or, + 2C = 100
4
365
Or, 2C = 100 -
4
400−365
Or, 2C =
4
35 35
Or, C= =
4×2 8
3
C=4
8
1 3
Thus, optimum solution is to 9 tables & 4 chairs per week. The profit per week can be
8 8
computed by substituting their values into objective functions.
73 35 981 5
Then profit= 12 +3 = = $122 per week.
8 8 8 8
1 1
Total number of chair and table produced 9 + 4 = 13 units.
8 2
73 35 1387 315 1702
Maximize total utilization= 19T + 9C = 19 +9 = + =
8 8 8 8 8

Multiply equation II by 4 & equation III by 3. Then subtract III from II

28T + 12C = 308

- 6T +- 12C =-240
22T = 68
68 34 1
T= = =3
22 11 3

(P.T.O)
 34
Substitute T = in equation III
11
34
2 + 4C = 80
11
68 880−68 203 5
Or, 4C = 80 - = = = 18
11 11 11 11
34 203 5
Then profit= 12 +3 = $92 per week
11 11 11
1 5 6
Total number of chair and table produced= 3 + 18 = 21
11 11 11
34 203 2473
Maximized total utilization= 19T + 9C = 19 +9 = = 224.81
11 11 11

Again,
Multiply equation I by 2 & equation III by 1.
20T + 4C = 200

-2T +- 4C =-80
18T = 120
120 20 2
T= = =6
18 3 3
20
Substitute T= in equation III.
3
20
2 + 4C = 80
3
40 200
4C = 80 - =
3 3
200 50 2
C= = =16
3×4 3 3
20 50
Profit= 12T + 3C= 12 +3 = 80 + 50 = $130
3 3
20 50 70 1
Total number of chair & table produced= + = = 23
3 3 3 3
20 50 380+450 830
Maximize total utilization= 19T + 9C = 19 +9 = = = 276.67
3 3 3 3

[P.T.O]
 4x + 9y ≤ 180 or 4x + 9y = 180 -------------- (i)
19x + 70y ≤ 1330 or 19x + 70y = 1330 ----- (ii)
5x + 7y ≤ 175 or 5x + 7y = 175 -------------- (iii)
5x + 3y ≤ 150 or 5x + 3y = 150 -------------- (iv)
Then, (i×19) – (ii×4)
73x + 171y = 3420

-73x -+ 280y =-5320

109y = 1900
1900
Y=
109

4x + 9y = 180
1900
Or, 4x + 9 = 180
109
17100
Or, 4x + = 180
109
17100 19620−17100 2520
Or, 4x = 180 - = =
109 109 109
2520 2520
Or, x = = = 5.77
109×4 436

Graphical Solution
The horizontal axis represent chair & the vertical axis represent table.
In graphing any straight line, only two points be identified, & the line is then drawn through
the two points.
The two required point for equation I, II & III are formed by first Letting C=0 and then
Letting T=0.
For equation I,
When C=0, then T=10; so, the point will be (0, 10)
When T=0, then C=50: So, the point will be (50, 0)
For equation II,
When C=0, then T=11; so, the point will be (0, 11)
When C=25.67 then T=0; so, the point will be (25.67, 0)
For equation III,
When C=0, then T=40; so, the point will be (0, 40)
When C=20, then T=0; so, the point will be (20, 0)

Now, we work out the revenue at different corner point on tabulated follow (with the help of
profit= 3C + 12T)
Feasible solution of product Corresponding
At point mix Revenue Total
C T From C From T
A 0 0 0 0 0
B 0 10 0 120 120
C 4.37 9.13
D 18.45 3.09
e 20 0 60 0 60
Linear Programming
Let, the amount of products 1,2 & 3 manufactured daily be X1, X2 & X3 respectively.
So, X1, X2 & X3 ≥
Since, negative production has no meaning & is not feasible.
The objectives are to maximize the profit. So, the objective function will be maximizing Z =
4X1 + 3X2 + 6X3 -------------------- (i)
(Express the constraints also as linear equalities/inequalities in term of variables)
Here, constraints are on the machine capacities & can be mathematically expressed as-
2X1 + 3X2 + 2X3 ≤ 440 ------------ (ii)
4X1 + 0X2 + 3X3 ≤ 40 ------------- (iii)
2X1 + 5X2 + 0X3 ≤ 430 ------------ (iv)
So, the complete linear programming problem is then given by maximizing Z = 4X1 + 3X2 +
6X3
Subject to 2X1 + 3X2 + 2X3 ≤ 440
4X1 + 0X2 + 3X3 ≤ 40
2X1 + 5X2 + 0X3 ≤ 430

Where, X1, X2, X3 ≥ 0