Scribd
Upload
35 views2 pages

Sapthagiri College of Engineering, Bangalore. Department of Computer Science and Engineering

This document contains 6 questions regarding linear programming and the simplex method. The questions cover concepts like degeneracy, basic solutions, solving linear programs using the simplex method, and using the two-phase simplex method. The linear programs involve objectives of maximizing or minimizing functions subject to various inequality and equality constraints involving two variables x1 and x2.

Uploaded by

Aasim Inamdar
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
35 views2 pages

Sapthagiri College of Engineering, Bangalore. Department of Computer Science and Engineering

This document contains 6 questions regarding linear programming and the simplex method. The questions cover concepts like degeneracy, basic solutions, solving linear programs using the simplex method, and using the two-phase simplex method. The linear programs involve objectives of maximizing or minimizing functions subject to various inequality and equality constraints involving two variables x1 and x2.

Uploaded by

Aasim Inamdar
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

SAPTHAGIRI COLLEGE OF ENGINEERING, BANGALORE.

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING.

Question Bank

Sem: VI ‘A’ & ‘B’

MODULE -2 : LINEAR PROGRAMMING -2, SIMPLEX METHOD -1


1. Explain the concept of degeneracy in simplex method.
2. Define basic solution. Find all the basic solutions of the following system of equations
identifying in each case the basic and non basic variables:
2x1 + x2 + 4x3 =11, 3x1 + x2 + 5x3 = 14
3. Solve the following LPP by simplex method.
Maximize z = 2x1 + 2x2
Subject to 5x1 + 3x2 ≤ 8,
2x1 + 4x2 ≤ 8, and x1, x2 ≥ 0.
4. Solve the following LPP by simplex method.
Maximize z = 3x1 + 2x2
Subject to x1 + x2 ≤ 4,
x1 – x2 ≤ 2, and x1, x2 ≥ 0
5. Solve the problem by simplex method
Maximize Z = 5x1 + 3x2
Subject to x1 + x2 ≤ 2,
5x1 + 2x2 ≤ 10,
3x1 + 8x2 ≤ 12, x1 ≥ 0 and x2

6. Solve the following LPP by two phase simplex method.


Minimize z = 0.4x1 – 0.5x2
Subject to 0.3x1 + 0.1x2 ≤ 2.7
0.5x1 + 0.5x2 = 6
0.6x1 + 0.4x2 ≥ 6
and x1, x2 ≥ 0

You might also like