Scribd
Upload
439 views

Assignment: Q.1 A Firm Makes Two Products X and Y, and Has A Total Production Capacity of 9 Tonnes

The document contains 9 questions related to linear programming problems (LPP). The questions involve formulating LPPs based on production, resource allocation, and profit maximization scenarios. They require setting up the LPPs in standard form and solving them using various methods like graphical, simplex, two-phase and Big M methods.

Uploaded by

manoj kumar sethy
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
439 views

Assignment: Q.1 A Firm Makes Two Products X and Y, and Has A Total Production Capacity of 9 Tonnes

The document contains 9 questions related to linear programming problems (LPP). The questions involve formulating LPPs based on production, resource allocation, and profit maximization scenarios. They require setting up the LPPs in standard form and solving them using various methods like graphical, simplex, two-phase and Big M methods.

Uploaded by

manoj kumar sethy
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

ASSIGNMENT

Q.1 A firm makes two products X and Y, and has a total production capacity of 9 tonnes
per day, X and Y requiring the same production capacity. The firm has a permanent contract
to supply at least 2 tonnes of X and at least 3 tonnes of Y per day to another company. Each
tonne of X requires 20 machine hours production time and each tonne of Y requires 50
machine hours production time. The daily maximum possible number of machine hours is
360. All the firm’s output can be sold, and the profit made is Rs. 80 per tonne of X and Rs.
120 per tonne of Y. It is required to determine the production schedule for maximum profit
and to calculate this profit. Formulate the LPP and solve it by graphical method.

Q.2 Three products A, B and C are produced at three machine centers X, Y and Z. Each
products involves operation at each of the machine centers. The time required for each
operation on various products is indicated in the following table
Products Machine centers Profit per
unit(Rs.)
X Y Z
A 10 7 2 12
B 2 3 4 3
C 1 2 1 1
Available 100 77 80
hours
a) Formulate a linear programming problem on the basis of above information.
b) Find out the product mix so as to maximize profit by simplex method.
c) Show that the total available hours of X and Y have been fully utilized and there is
surplus hours of Z. How many hours are surplus in machine center Z?

Q.3 Solve the following LPP by Simplex method

Maximize Z = 8x1 + 5x2 +12x3


Subject to 2x1 + 5x2 + 4x3 ≤ 44
3x1 – 7x2 – 6x3 ≥ –10
7x1 + 2x2 +4x3 = 54
x1, x2 ≥ 0 x3: unrestricted in sign

Q.4 Transform the following LPP to standard form:


min Z=−3 x1 + 4 x 2−2 x 3 +5 x 4
Subject ¿ :
4 x1 −x2 +2 x 3−x 4=−2
x 1+ x2 +3 x 3−x 4 ≤14
−2 x1 +3 x 2−x 3+ 2 x 4 ≥ 2
x 1 , x 2 , x3 , x 4 ≥0
ASSIGNMENT

Q.5 A company produces two types of pencils, say A and B. Pencil A is of superior quality
and the pencil B is of lower quality. Profits on the pencils A and B are Rs. 5 and 3 per pencil
respectively. Raw material required for each pencil A is twice as much as that of pencil B.
The supply of raw material is sufficient only for 1000 pencils of type B per day. Pencil A
requires a special clip and only 400 clips are available per day. For pencil B only 700 clips are
available per day. Use Graphical method to find the product-mix that the company can
make to make maximum profit.

Q.6 solve the following LPP by Two phase method


Min. Z = -3x1 + x2 + x3
Subject to
x1 - 2x2 + x3 < 11
-4x1 + x2 + 2x3 > 3
2x1 – x3 = -1
x1 > 0 , x 2 > 0 , x 3 > 0
Q.7 Consider the following Linear Programming Problem

Maximize Z=3 x1 +2 x 2
Subject to x 1−2 x2 ≤1 ,
x 1+ x2 ≤3 , x 1 , x 2 ≥ 0
Solve this
(a) by Simplex method (strictly using the simplex algorithm)
(b) also solve it by taking x 2 , x 1as entering variables in the same order in Simplex
iterations.
Compare and contrast these two procedures and write your observations.

Q.8 A manufacturing company wants to manufacture a product in three ways by using


different procedures. Let A, B, C are the products manufactured by these different
procedures. The production capacity of the company is 10,000 in total. The sales prices of A,
B, C are 2000, 3000, 1000 per item. The raw material required is 100 kg for A and B, 50 kg
for C. The cost of the raw material is Rs. 0.50 per kg. The man power required is 5 man days
for A and C , 6 man days for B. On the whole a total of 400 man days are available at the rate
of Rs.20, 000 per man day.

Formulate this as a Linear Programming Problem which maximizes the profit.

Q.9 Use Big M method to solve the following L.P.P


Minimise Z=2 x 1 + x 2
Subject to
3 x 1+ x 2=3
4 x1 +3 x 2 ≥ 6
x 1+ 2 x 2 ≤ 3
x1 , x2 ≥ 0

You might also like