Scribd
Upload
13 views

Assignment Simplex

The document contains 6 questions asking to solve different linear programming problems using the simplex method or big 'M' method. Each question defines an objective function to maximize or minimize subject to multiple constraints and non-negativity conditions on the variables.

Uploaded by

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

Assignment Simplex

The document contains 6 questions asking to solve different linear programming problems using the simplex method or big 'M' method. Each question defines an objective function to maximize or minimize subject to multiple constraints and non-negativity conditions on the variables.

Uploaded by

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

K.T.H.

M college Nashik,
Department of mathematics
Mathematics practical S.Y.Bcs
Assignment No-2

Q.1 Solve the following Lpp by simplex method.


𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑍 = 𝑥1 + 4𝑥2 + 5𝑥3
Subject to 𝑥1 +3𝑥2 ≤ 22
3𝑥1 +2𝑥2 ≤ 14
𝑥1 +2𝑥2 + 3𝑥3 ≤ 14
𝑥1 , 𝑥2 , 𝑥3 ≥ 0

Q.2 Solve the following Lpp by simplex method.


𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑍 = 3𝑥1 + 2𝑥2 + 3𝑥3
Subject to 2𝑥1 +𝑥2 + 𝑥3 ≤ 2
3𝑥1 +4𝑥2 + 2𝑥3 ≤ 8
𝑥1 , 𝑥2 , 𝑥3 ≥ 0

Q.3 Solve the following Lpp by simplex method.


𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑍 = 10𝑥 + 6𝑦 + 2𝑧
Subject to −𝑥 + 𝑦 + 𝑧 ≥ 1
3𝑥 + 𝑦 − 𝑧 ≥ 2
𝑥, 𝑦, 𝑧 ≥ 0

Q.4 Solve the following Lpp by simplex method.


𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑍 = 2𝑥1 + 4𝑥2
Subject to 2𝑥1 +𝑥2 ≤ 18
3𝑥1 +2𝑥2 ≥ 30
𝑥1 + 2𝑥2 = 26
𝑥1 , 𝑥2 ≥ 0
Q.5 Solve the following Lpp by simplex method.
𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑍 = 3𝑥1 + 2𝑥2 + 3𝑥3
Subject to 2𝑥1 +𝑥2 + 𝑥3 ≤ 2
3𝑥1 +4𝑥2 + 2𝑥3 ≤ 8
𝑥1 , 𝑥2 , 𝑥3 ≥ 0

Q.6 Solve the following Lpp by big ‘M’ method.


𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑍 = 4𝑥1 + 2𝑥2 + 3𝑥3
Subject to 2𝑥1 + 4𝑥3 ≥ 5
2𝑥1 +3𝑥2 + 𝑥3 ≥ 4
𝑥1 , 𝑥2 , 𝑥3 ≥ 0

You might also like