Scribd
Upload
2 views

Graphical Method(Questions)

The document presents a series of linear programming (LP) problems, including both maximization and minimization objectives with various constraints. It includes graphical solutions for some problems and seeks to determine optimal production levels for different scenarios. The problems are designed for practice in solving LP formulations and interpreting results.

Uploaded by

sp3642447
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
2 views

Graphical Method(Questions)

The document presents a series of linear programming (LP) problems, including both maximization and minimization objectives with various constraints. It includes graphical solutions for some problems and seeks to determine optimal production levels for different scenarios. The problems are designed for practice in solving LP formulations and interpreting results.

Uploaded by

sp3642447
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

SELF PRACTICE PROBLEMS

1. Comment on the solution of the following LP problems.


() Max Z = 4x, + 4x, (ii) Max Z= 5x, + 3x, (ii) Max Z- 4x, + 2x
subject to X+ 2x, S 10 subject to 4x, + 2x, s 8 subject to-x t 2x, S 6
6x, + 6x, < 36 23
s6 and
and and
(iv) Min Z x -2x (v) Max Z= 6x, + 12x, (vi) Max Z= 3x, + 5x, X, 2 100
subject to-2x, 8 subject to
+ 2x, s 10 400
-24
subject to 5x, +1Ox, s
2x, - 5x, s 20 440
and 6x, + 8x, S
X + X S 15
and
and

(vii) Max Z 1.75 x, + 1.5 x, (viii) Max Z = 3x, + 2x, (ix) Max Z= 5x, + 3x,
subject to 8x, + 5x, s 320 subject to -2x, + 3x, S 9 subject to 3x + 5x, s 15
4x, + 5x, s 20 X- 5X, 2 -20 5x, + 2x, s 10
and
x, 15; x, 2 10 and
and [Kerala, BSc(Engg), 1995)

(x) Max Z= x + Xy
subject to
-3x, + X 3
and

your solution indicates.


2. Sove the ollowing LP problems graphically and state what
(ii) Min Z= 3x, + 5x2 (ii) Min Z= 20x + 10x,
(0) Mn Z= 4x - 2x subject to -3x, + 4x, S 12 subject to X + 2x, S 40
subyect to X + X, S 14
2-2
3x, + 2x, > 36 2x - 3X4
X, S 24 2X1 +
3x2 2 12 4x + 3x, 60
2x, + 2 2 and
x S 4; X
and

are available per day. For belt Bonly 700 buckles are available per
(v) Max Z= x y day. Solve this problem to determine how many units of the two
Subyect to types of belts the company should manufacture in order to have
3x, - S-3 the maximum overall profit?
end 6. Consider a small plant which makes two types of
parts, say A and B. It buys autoIoble
parts P, and P, that

You might also like