Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
79 views

Assignment 3

This document contains 6 optimization problems to solve using different linear programming techniques including the simplex method, Big-M method, two-phase method, dual simplex method, and finding the dual problem. The problems involve maximizing or minimizing linear functions subject to various inequality and equality constraints on the variables.

Uploaded by

Ramanuj Dixit
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
79 views

Assignment 3

This document contains 6 optimization problems to solve using different linear programming techniques including the simplex method, Big-M method, two-phase method, dual simplex method, and finding the dual problem. The problems involve maximizing or minimizing linear functions subject to various inequality and equality constraints on the variables.

Uploaded by

Ramanuj Dixit
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

MAT2004 Optimization in Engineering

ASSIGNMENT - 3

( Operations Research )

1. Solve the following LPP using Simplex method, and verify your answer by graphically:

Maximize Z = −x1 + 2x2


subject to the constraints
− x1 + x2 ≤ 1,
x1 + x2 ≤ 2,
x1 , x2 ≥ 0.

2. Solve the following LPP using Big-M method and verify your answers:

Maximize Z = 5x1 + 3x2


subject to the constraints
2x1 + x2 ≤ 1,
x1 + 4x2 ≥ 6
x1 , x2 ≥ 0.

3. Solve the following LPP using Two phase method :

Maximize Z = x1 − 2x2 − 3x3


subject to the constraints
− 2x1 + x2 + 3x3 = 2,
2x1 + 3x2 + 4x3 = 1
x1 , x2 , x3 ≥ 0.

4. Solve the following LPP using Dual simplex method :

Maximize Z = −x1 − 4x2 − 3x4


subject to
x1 + 2x2 − x3 + x4 ≥ 3,
− 2x1 − x2 + 4x3 + x4 ≥ 2
x1 , x2 , x3 , x4 ≥ 0.

5. Find the dual problem of the following LLP :

Minimize Z = 5x1 + 12x2 + 4x3


subject to the constraints
x1 + 2x2 + x3 ≤ 5,
2x1 − x2 + 3x3 = 2
x1 + 4x2 − x3 ≥ 1,
x1 , x2 ≥ 0, and x3 is unrestricted in sign.

6. Verify that the dual of dual is primal for the following problem:

Maximize Z = 5x1 + 3x2


subject to
2x1 + x2 ≤ 1,
x1 + 4x2 ≥ 6
x1 , x2 ≥ 0.

Dr. Ajay K. Bhurjee VIT Bhopal University 1

You might also like