Mathematical Programming

Assignment-1
August 9, 2013
Solve the following LPPs according to given constraints:
1. Maximise z = 6x1 2x2
s.t.
2x1 x2 2
x1 4
x1 , x2 0
2. Maximise z = 3x1 + 5x2 + 4x3
s.t.
2x1 + 3x2 8
2x2 + 5x3 10
3x1 + 2x2 + 4x3 15
x1 , x2 , x3 0
3. Maximise z = 3x1 + 2x2 + 3x3
s.t.
2x1 + x2 + x3 2
3x1 + 4x2 + 5x3 8
x1 , x2 , x3 0
4. Minimise z = x1 3x2 + 2x3
s.t.
3x1 x2 + 2x3 7
2x1 + 4x2 12
4x1 + 3x2 + 8x3 10
x1 , x2 , x3 0

5. Maximise z = 2x1 x2
s.t.
3x1 + x2 = 7
4x1 + 3x2 6
x1 + 2x2 3
x1 , x2 0
6. Maximise z = 4x1 + 10x2
s.t.
3x1 + x2 = 7
2x1 + x2 50
2x1 + 5x2 100
2x1 + 3x2 90
x1 , x2 0