Scribd
Upload
18 views2 pages

Assignment-1: X X Maxz X X X X X X

The document outlines a series of linear programming problems and methods, including maximizing profit from production of bucket lids and handles, solving linear programming problems using the simplex method, big-M method, and two-phase simplex method. It also includes tasks to find basic solutions and feasible solutions for given constraints. Each problem requires applying specific mathematical techniques to derive optimal solutions under various constraints.

Uploaded by

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

Assignment-1: X X Maxz X X X X X X

The document outlines a series of linear programming problems and methods, including maximizing profit from production of bucket lids and handles, solving linear programming problems using the simplex method, big-M method, and two-phase simplex method. It also includes tasks to find basic solutions and feasible solutions for given constraints. Each problem requires applying specific mathematical techniques to derive optimal solutions under various constraints.

Uploaded by

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

ASSIGNMENT-1

1 In a metal shop two articles are produced, i.e., bucket lids and pressed metal handles. The
lid takes 20 seconds to stamp, 30 secs. to form and 20 secs. to paint. The handle takes 40
secs. to stamp, 10 secs. to form and 60 secs. to paint. The profit margin on lids and
handles are 6 and 9 paise respectively. The time available per day on each process is 8
hours and 20 minutes.
(i) How many lids and handles should be produced to maximize profit? Find also the
maximum profit.
(ii) Will the production policy change if profit margins were reversed? How much profit will
be earned then?
(iii) What will be the production policy and maximum gross profit with given original
objective function and capacities, if there is a market restriction of 750 handles?

2 Find basic solutions; identify basic feasible solutions, degenerate basic feasible solutions.
Show that there is a correspondence with the graphical corner points:
MaxZ  4 x1  2 x2
subject to constraints
x1  x 2  x3  3
x1  x 2  x 4  0
x1 , x 2 , x3 , x 4  0 .

3 Solve the following LPP:


Maximize: Z  4 x1  x 2  3x3  5 x 4
subject to the constraints:
4 x1  6 x 2  5 x3  4 x 4  20 ,
 3x1  2 x 2  4 x3  x 4  10
 8 x1  3x 2  3x3  2 x 4  20
and x1 , x 2 , x 3 , x 4  0 .

4 Solve the following LPP:


Max. Z  x1  3x 2
subject to the constraints:
x1  x 2  2 ,
 x1  x 2  4 ,
and x 2  0 , x1 is unrestricted

5 Use penalty (Big-M)method to


Maximize: Z  3x1  x2
subject to the constraints:
2 x1  x2  2 ,
x1  3x2  3 ,
x2  4
and x1 , x2  0 .

6 Solve by using big-M method the following LP problem:


Min. Z   x1  2 x 2  3x 3  x 4  25
subject to the constraints
x1  2 x2  3x3  15
2 x1  x2  5 x3  20
x1  2 x2  x3  x4  10
and x1 , x2 , x3 , x4  0 .

7 Use the two-phase simplex method to


1
Max. Z  2 x1  x2  x3
4
subject to the constraints
4 x1  6 x 2  3x3  8
3x1  6 x 2  3x3  1
2 x1  3x 2  5 x 3  4
and x1 , x 2 , x 3  0 .

8 Use the two-phase simplex method to solve the following LPP


Min. Z  x1  x2
subject to the constraints:
x1  x2  1 ,
2 x1  3x2  6 ,
and x1 , x2  0 .

9 Solve the following LPP:


Max. Z  5x1  3x 2
subject to the constraints:
x1  x 2  2 ,
5x1  2 x 2  10 ,
3x1  8x2  12
and x1 , x2  0 .

10 The two consecutive simplex tables of an LPP are given as follows:

Basic CB XB x1 x2 x3 x4 x5
Variable
x4 - 9 A B C D 0
x5 - 2 -2 -1 E 0 F
zj-cj G -1 3 0 0
x1 - N J 2/3 2/3 1/3 0
x5 - 8 K 1/3 1/3 2/3 1
zj-cj 0 -5 L M 0

Find the missing entries A,B,C,D,E F,G,H,J,K,L,M,N in the above table.

You might also like