[go: up one dir, main page]
Scribd
Upload
18 views1 page

Practical 2

The document outlines practical exercises for solving linear programming problems using the Simplex Method. It includes setting up initial simplex tables, testing for degenerate and unbounded solutions, and finding optimal solutions for various linear programming problems. The exercises involve maximizing objective functions subject to given constraints.

Uploaded by

Ramdas Sonawane
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 views1 page

Practical 2

The document outlines practical exercises for solving linear programming problems using the Simplex Method. It includes setting up initial simplex tables, testing for degenerate and unbounded solutions, and finding optimal solutions for various linear programming problems. The exercises involve maximizing objective functions subject to given constraints.

Uploaded by

Ramdas Sonawane
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/ 1

Ness Wadia College of Commerce, Pune – 01

Department of Statistics and Computer Applications


246 F: Business Statistics – I
Practical II: - LPP Simplex Method
1. Set up an initial simplex table, given the Test whether this problem has degenerate
following two constraints and objective solution.
function: 5. Consider the LPP:
𝑀𝑎𝑥. 𝑧 = 3𝑥1 + 9𝑥2 𝑀𝑎𝑥. 𝑧 = 2𝑥1 + 𝑥2
𝑠𝑢𝑏j𝑒𝑐𝑡 𝑡𝑜, 𝑠𝑢𝑏j𝑒𝑐𝑡 𝑡𝑜,
𝑥1 + 4𝑥2 ≤ 24 𝑥1 − 𝑥2 ≤ 10,
𝑥1 + 2𝑥2 ≤ 16 2𝑥1 − 𝑥2 ≤ 40,
𝑥1, 𝑥2 ≥ 0 𝑥1, 𝑥2 ≥ 0.
Briefly list the iterative steps necessary to solve Test whether this problem has unbounded
the problem. Determine the next table from the solution.
one you developed. Determine whether it is an 6. Consider the LPP:
optimum solution. If necessary, develop 𝑀𝑎𝑥. 𝑧 = 4𝑥1 + 14𝑥2
another table and determine whether it is an 𝑠𝑢𝑏j𝑒𝑐𝑡 𝑡𝑜,
optimum solution. Interpret this table. Find 2𝑥1 + 7𝑥2 ≤ 21,
optimal solution. 7𝑥1 + 2𝑥2 ≤ 21,
2. Use the simplex method to solve the following 𝑥1, 𝑥2 ≥ 0.
linear programming problem. Your final Test whether this problem has more than one
answer should be 𝑓𝑚𝑎𝑥 and the 𝑥 and 𝑦 values optimal solution.
for which 𝑓 assumes its maximum value.
𝑀𝑎𝑥. 𝑓 = 2𝑥 + 𝑦
𝑠𝑢𝑏j𝑒𝑐𝑡 𝑡𝑜,
𝑥 + 3𝑦 ≤ 14
2𝑥 + 𝑦 ≤ 11
𝑥, 𝑦 ≥ 0.
3. Use the simplex method to solve the following
linear programming problem. Your final
answer should be 𝑓𝑚𝑎𝑥 and the 𝑥, 𝑦 and 𝑧 values
for which 𝑓 assumes its maximum value.
𝑀𝑎𝑥. 𝑓 = 2𝑥 + 𝑦 + 3𝑧
𝑠𝑢𝑏j𝑒𝑐𝑡 𝑡𝑜,
𝑥 + 2𝑦 + 𝑧 ≤ 25
3𝑥 + 2𝑦 + 2𝑧 ≤ 30
𝑥, 𝑦, 𝑧 ≥ 0.
4. Consider the LPP:
𝑀𝑎𝑥. 𝑧 = 2𝑥1 + 𝑥2
𝑠𝑢𝑏j𝑒𝑐𝑡 𝑡𝑜,
4𝑥1 + 3𝑥2 ≤ 12,
4𝑥1 + 𝑥2 ≤ 8,
4𝑥1 + 2𝑥2 ≤ 8,
𝑥1, 𝑥2 ≥ 0.

You might also like