Scribd
Upload
145 views

Assignment 1 (Marks 10 10 100) (Graphical, Simplex, Two Phase and Big M Method)

This document provides 10 questions as part of an assignment on linear programming techniques. The questions cover a range of LP concepts including graphical solution, simplex method, two-phase method, and Big M method. Students are asked to solve various LP problems using different approaches and identify optimal solutions, binding constraints, and whether any problems have multiple optimal solutions.

Uploaded by

G sai supreeth
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
145 views

Assignment 1 (Marks 10 10 100) (Graphical, Simplex, Two Phase and Big M Method)

This document provides 10 questions as part of an assignment on linear programming techniques. The questions cover a range of LP concepts including graphical solution, simplex method, two-phase method, and Big M method. Students are asked to solve various LP problems using different approaches and identify optimal solutions, binding constraints, and whether any problems have multiple optimal solutions.

Uploaded by

G sai supreeth
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

ASSIGNMENT 1 (Marks=10*10= 100)

(Graphical, Simplex, Two phase and Big M method)

Q1) Solve the following LP graphically. Also identify the binding and redundant
constraint(s).

Maximize z =7x1 + 10x2

x1 ≤ 36

x2 ≤12

x1 + 4x2 ≤ 60

2x1+ x2 ≥ 30

x1 – x2 ≥ 0

and x1 ≥ 0, x2 unrestricted.

Q2) Consider the following LP:

Maximize z = x1 + 3x2

Subject to: x1 + x2 ≤ 4

x1 - x2 ≤ 2

x1 ≥ 0, x2 = unrestricted

(i) Determine all the basic solutions of the problem, and classify them as feasible
and infeasible.

(ii) Solve the problem using graphical approach.

Q3) Consider the LP:

(A) Maximize 3x1+ 4x2 (B) Maximize x1+ 2x2

Subject to 3x1+ 2x2 ≤ 30

x1+ 2x2 ≤ 22

x1, x2 ≥ 0

Solve A and B using the tabular simplex method. Which problem has multiple
optimal solutions?
Q4) Use tabular Simplex method to solve the following LP Problem:

Maximize 3x1+ 4x2+ x3

Subject to constraints:
x1+ 2x2+ 3x3 ≤ 90
2x1+ x2+ x3 ≤ 60
3x1+ x2+ 2x3 ≤ 80
x1 ,x2 ,x3 ≥ 0

Q5) Solve the following LP problem using Big M method:

Minimize 3x1 + 2.5x2

Subject to constraints:

x1 + 2x2 ≥ 20
5x1 + 2x2 ≥ 50
x1, x2 ≥ 0

Q6) Use Big M Simplex Method to solve the following LP Problem:

Maximize 30x1+ 20x2

Subject to constraints:

-x1- x2 ≥ -8
-6x1 - 4x2 ≤ -12
5x1+ 8x2 = 20
x1, x2 ≥ 0

Q7) Consider the following LP:

Minimize 0.4 x1 + 0.5 x2

Subject to 0.3x1 + 0.1x2 ≤ 1.8


x1 + x2 = 12
0.6x1 + 0.4x2 ≥ 6
x1 , x2 ≤ 0

Use the two phase variant of simplex method to find an initial basic feasible solution.
Q8) Solve the following LP problem using the two phase simplex method:

Maximize 2x1 + 3x2 + x3

Subject to x1 + x2 + x3 ≤ 40
2x1 + x2 -x3 ≥ 10
-x2 + x3 ≥ 10
x1 ,x2 ,x3 ≥ 0

Q9) Solve the following LP problem using the simplex method. Please indicate if you
have found a degenerate solution.

Maximize 3x1 + x2

Subject to x1 + 2x2 ≤ 5
x1 + x2 – x3 ≤ 2
7x1 + 3x2 – 5x3 ≤ 20
x1, x2 ,x3 ≥ 0

Q10 Solve the following LP problem using the simplex method. If you change the
objective to maximization type, what would be the optimal solution?

Minimize -x1 + x2

Subject to x1 - 4x2 ≥ 5
x1 -3x2 ≤ 1
2x1 - 5x2 ≥1
x1, x2 ≥ 0

You might also like