Scribd
Upload
287 views5 pages

Man203 Chapter 2 Simplex Method

This document contains 14 examples of linear programming problems presented in their standard form. The examples provide the objective function and constraints for each problem and ask the reader to solve the problems by converting them to simplex form and calculating the optimal solution through multiple simplex table iterations. Some examples ask the reader to establish up to two maximum simplex tables while others ask to directly solve the given linear program using the simplex method. The examples cover a range of common linear programming problem types and structures.

Uploaded by

ŞevkiEmreBeşir
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
287 views5 pages

Man203 Chapter 2 Simplex Method

This document contains 14 examples of linear programming problems presented in their standard form. The examples provide the objective function and constraints for each problem and ask the reader to solve the problems by converting them to simplex form and calculating the optimal solution through multiple simplex table iterations. Some examples ask the reader to establish up to two maximum simplex tables while others ask to directly solve the given linear program using the simplex method. The examples cover a range of common linear programming problem types and structures.

Uploaded by

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

MAN 203 _ QUANTITATIVE ANALYSIS

CHAPTER 2
SIMPLEX METHOD
rt. Grv. Cemil Kuzey

Ex 1_ Convert the following linear program into the simplex form:


Minimize
3x1 + 2x2
Subject to:
7x1 - 2x2
5x1 + x2
x1 + 7x2
3x1 + 3x2 =
x1, x2 0

0
10
12
16

Ex 2_ Consider the following linear program:


Maximize Z = 3 X1 + 2 X2 X3
Subject to:
X1 + X2 + 2 X3 10
2 X1 X2 + X3 20
3 X1 + X 2
15
X1, X2, X3 0
(a) Convert the above constraints to equalities by adding the appropriate slack
variables.
(b) Set up the initial simplex tableau and solve.

Ex 3_ Solve the given LP model by using Simplex method


Z max = 9x+7y
s. t.
2x+y <= 40
x+3y <=30

Ex 4_ Solve the given LP model by using Simplex method


Z min = 4x+5y
s. t.
x+2y >= 80
1

3x+y >=75

Problems:
1_ solve the LP model by using Simplex method
Z max = 6x+7y
s. t.
2x+3y <= 120
2x+y <=80
4x+4y <= 400

(Production hours)
(Assembly hours)
(Packing Hours)

2_ Establish max 2 simplex table of the given model


Zmax = 60x+ 43y
3x+y >= 9
3x+2y =12
x+2y <=10
3_ Establish max two simplex table of the given model
Zmax = 60x+ 40y + 20z
1)3x+y-2z >= 9
2)2y+12z =12
3)y+5z <=10

4_ solve the LP model by using Simplex method


Z max = 3x+5y
s. t.
y <= 6
3x+2y <=18
5_ solve the LP model by using Simplex method
Z max = 6x+3y
s. t.
2x -2y <= 2
-x+ y <= 1
6_ solve the LP model by using Simplex method
Z max = 6x+3y
2

s. t.
2x -2y <= 2
-x+ y <= 1

7__ Establish maximum two simplex table for the given LP model
Zmin = 50x+ 10y + 75z
x y = 1000
2y+2z = 2000
x <= 1500

8_ Establish maximum two simplex table for the given LP model


Z max = 100x+ 200y + 150z
5x+20y+30z <= 60
10x+20y+50z <= 100

9_ Establish maximum two simplex table for the given LP model


Zmin = 5x+ 3y + 6z
2x-y+4z >= 20
-3x+6y+4z =15
x+2z <=10
10 _ Establish maximum two simplex table for the given LP model
Zmin = 100x+ 60y
10x+5y >= 20
3x+5y >= 15
10x+5y >= 15
11_ Establish maximum two simplex table for the given LP model

Zmax = 20x+ 6y + 8z
8x+2y+2z <= 200
3

4x+3y <= 100


2x+z <= 50
z <= 20
12_ Convert the following linear program into a simplex model form:
Maximize
Subject to:

8X + 10Y
5X + 3Y 34
2X + 3Y = 22
X 3
X, Y 0

13_ Establish maximum of 2 simplex table:


Maximize Z = 3 X1 + 2 X2 X3
Subject to:
X1 + X2 + 2 X3 10
2 X1 X2 + X3 20
3 X1 + X 2
15
X1, X2, X3 0

14_ the LP model is given as:


Maximize Z = 3 X1 + 2 X2 X3
Subject to:
X1 + X2 + 2 X3 10
2 X1 X2 + X3 20
3 X1 + X 2
15
X1, X2, X3 0

Cj
0
0
3

3
Sol. Mix X1
S1
0
S2
0
X1
1
Zj
CjZj

3
0

2
X2
2/3
5/3
1/3
1
1

Table
1
X3
2
1
0
0
1

A
0
S1
1
0
0

0
S2
0
1
0

0
S3
1/3
2/3
1/3

0
0

0
0

1
1

RHS(Qty)
5
10
5
15

a)
b)
c)
d)

Is the simplex table optimum? Why?


Write the basic variables and its values
Write the non-basic variables and its values
Write the current profit
Table B

Cj

2
0
3

e)
f)
g)
h)
i)

Main
varb(Sol.
Mix)
X2
S2
X1

3
X1

2
X2

1
X3

0
S1

0
S2

0
S3

Quantity

0
0
1

1
0
0

3
6
1

3/2
5/2
1/2

0
1
0

1/2
3/2
1/2

15/2
45/2
5/2

0
0

1/2
1/2

45/2

Zj
3
2
3
3/2
CjZj 0
0
4
3/2
Is the simplex table optimum? Why?
Write the optimum solution
Write the basic variables and its values
Write the non-basic variables and its values
Write the current profit

You might also like