Scribd
Upload
22 views

Linear Programming Problems 07-02-2022

Bcom

Uploaded by

st0195461
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
22 views

Linear Programming Problems 07-02-2022

Bcom

Uploaded by

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

Linear programming Problems 2022

SOLUTION TO LPP

A Linear Programming Problem is formulated in order to obtain a solution, ie, to


find the unknown variables, say x and y. An optimal solution to an LPP is
obtained by choosing from several values of decision variable. An optimal
solution will be one set of values that satisfies the given set of constraint
simultaneously and also provides maximum profit or minimum cost, as per given
objective function.

LINEAR PROGRAMMING Problems

1. Suppose an industry is manufacturing two types of products P1 and


P2. The profits per Kg of the two products are Rs.30 and Rs.40
respectively. These two products require processing in three types of
machines. The following table shows the available machine hours per
day and the time required on each machine to produce one Kg of P1 and
P2. Formulate the problem in the form of linear programming model.
Profit/Kg P1 P2 Total
available
Rs.30 Rs.40
Machine

hours/day
Machine 3 2 600
1
Machine 3 5 800
2
Machine 5 6 1100
3

Dr Josheena Jose
Linear programming Problems 2022
Solution:

The procedure for linear programming problem formulation is as


follows: Introduce the decision variable as follows:

Let x1 = No. of units of P1

x2 = No. of units of P2

In order to maximize profits, we establish the


objective function as: 30x1 + 40x2
Since one Kg of P1 requires 3 hours of processing time in machine 1
while the corresponding requirement of P2 is 2 hours. So, the first
constraint can be expressed as: 3x1 + 2x2 ≤ 600

Similarly, corresponding to machine 2 and 3 the


constraints are: 3x1 + 5x2 ≤ 800
5x1 + 6x2 ≤ 1100
In addition to the above there is no negative production, which may be
represented algebraically as: x1 ≥ 0 and x2 ≥ 0
Thus, the product mix problem in the linear programming model is as follows:
Maximize
30x1 + 40x2
Subject to:
3x1 + 2x2 ≤ 600

3x1 + 5x2 ≤ 800

5x1 + 6x2 ≤ 1100

x1≥ 0, x2 ≥ 0

Question 2:

Dr Josheena Jose
Linear programming Problems 2022
A company owns two flour mills viz. A and B, which have different
production capacities for high, medium and low quality flour. The company
has entered a contract to supply flour to a firm every month with at least 8,
12 and 24 quintals of high, medium and low quality respectively. It costs
the company Rs.2000 and Rs.1500 per day to run mill A and B respectively.
On a day, Mill A produces 6, 2 and 4 quintals of high, medium and low
quality flour, Mill B produces 2, 4 and 12 quintals of high, medium and low
quality flour respectively. How many days per month should each mill be
operated in order to meet the contract order most economically.

Solution:

Let us define x1 and x2 are the mills A and B.


Here the objective is to minimize the cost of the machine runs and
to satisfy the contract order. The linear programming problem is:
Minimize
2000x1 + 1500x2
Subject to:
6x1 + 2x2 ≥ 8

2x1 + 4x2 ≥ 12

4x1 + 12x2 ≥ 24

x1 ≥ 0, x2 ≥ 0
Question: 3
The manager of an oil refinery must decide on the optimal mix of two
possible blending processes of which the inputs and outputs per production
run are as follows:

Production Run Crude A Crude B Diesel X Diesel B


1 6 3 6 9

Dr Josheena Jose
Linear programming Problems 2022
2 5 6 5 5
Maximum availability of crude A and B are 250 units and 200 units
respectively. The market requirement shows that at least 150 units of
Diesel X and 130 units of Diesel Y must be produced. The profits per
production run from process 1 and 2 are Rs 40 and Rs 50 respectively.
Formulate the problem for maximizing the profit
Let x, y be the number of production runs of the
two processes respectively. The objective is to
6x + 5y ≤ 250 (Crude material constraint)
3x +6y ≤ 200 (Crude material constraint)
6x + 5y ≥ 150 (demand constraint)
9x + 5y ≥ 130 (demand constraint)
maximize profit Z = 40x + 80y
The constraints of the problems are :

Now the formulated problem is:

Max Z = 40x + 80y


Subject to 6x + 5y ≤ 250
3x +6y ≤ 200
6x + 5y ≥ 150
9x+ 5y ≥ 130
≥0,y ≥ 0

4. A Manufacturer of furniture makes two products, chairs and tables. Processing


of these products is done on two machines A and B. A Chair requires 2 hours on
machine A and 6 hours on machine B. A table requires 5 hours on machine A and
no time on machine B. There are 16 hours of time per day available on machine
A and 30 hours on Machine B. Profit gained by the manufacturer from a chair is

Dr Josheena Jose
Linear programming Problems 2022
Re.1 and from a table is Rs. 5 respectively. Formulate the Problem to maximize
the total profits.

5. A home resourceful decorator manufacturer two types of lamps say A and


B. Both lamps go through two technicians first a cutter and second a finisher.
Lamp A requires 2 hours of cutter's time and one hour of the finisher's time; Lamp
B requires 1 hour of cutter's and 2 hours of finishers time. The cutter has 104
hours and finisher has 76 hours of available time each month. Profit on the lamp
A is Rs. 6 and on one B lamp is Rs 11. Formulate a mathematical model.

1. A company produces two types of cowboy 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 types to 150 and 250 hats. If
the profit per hat are Rs. 8 and for type 1 and Rs.5 for type 2, formulate the
problem as a linear programming model in order to determine the number of
hats to be produced of each type to maximize the profit.
&&&&&&&&&&&&

Dr Josheena Jose

You might also like