Scribd
Upload
129 views

Tutorial 3 PDF

This document contains 8 problems related to linear programming and optimization techniques like finding basic feasible solutions and using the simplex method. The problems involve setting up and solving systems of linear equations, determining basic feasible solutions, finding optimal solutions to linear programs, and using the simplex method to minimize or maximize objectives subject to various constraints.

Uploaded by

Animesh Choudhary
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
129 views

Tutorial 3 PDF

This document contains 8 problems related to linear programming and optimization techniques like finding basic feasible solutions and using the simplex method. The problems involve setting up and solving systems of linear equations, determining basic feasible solutions, finding optimal solutions to linear programs, and using the simplex method to minimize or maximize objectives subject to various constraints.

Uploaded by

Animesh Choudhary
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

BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE, PILANI - KK BIRLA

GOA CAMPUS
FIRST SEMESTER 2014-2015

Optimization
Tutorial3

1. Find all the basic solutions corresponding to the system of equations:

2x1 + 3x2 2x3 7x4 = 1


x1 + x2 + x3 + 3x4 = 6
x1 x2 + x3 + 5x4 = 4.

2. Given the following set of equations

x1 + 4x2 x3 = 3
5x1 + 2x2 + 3x3 = 4.

Determine the basic feasible solution involving x1 and x2 . Do basic feasible solutions exist for x1 and x3
and for x2 and x3 ?

3. Find the vertex, in which x1 and x2 both are > 0, of the set of feasible solutions for the following problem

x1 + x2 + x3 3
2x1 + 2x2 x3 2
x1 , x2 , x3 0.

4. Write the constraint equations for the following LPP:

Maximize z = x1 + 2x2 + 3x3 + 4x4 + 0x5 + 0x6 + 0x7 ,

subject to

x1 + 2x2 + x3 + 3x4 + x5 = 9
2x1 + x2 + 3x4 + x6 = 9
x1 + x2 + x3 + x7 = 0
x1 , x2 , x3 , x4 , x5 , x6 , x7 0.

Also, determine which of the following vectors are basic feasible solutions to the above problem?

(a) (3, 3, 0, 0, 0, 0, 0), (b) (0, 0, 0, 3, 0, 0, 0), (c) (1, 0, 0, 0, 8, 7, 1),


(d) (2, 2, 0, 1, 0, 0, 0), (e) (0, 0, 0, 0, 9, 9, 0), (f) (0, 0, 9, 0, 0, 9, 9).
5. Use Simplex Method to find the optimal solution of the following LPP:

(a) Maximize z = 40x1 + 35x2


Subject to 2x1 + 3x2 60, 4x1 + 3x2 96, x1 0, x2 0.
(b) Minimize z = 30x1 40x2 35x3
Subject to 3x1 + 4x2 + 2x3 90, 2x1 + x2 + 2x3 54 x1 + 3x2 + 2x3 93, x1 0, x2 0, x3 0.

6. Solve the following LPP by Simplex method

Minimize z = x2 3x3 + 2x5 ,

subject to

x1 + 3x2 x3 + 2x5 = 7
2x2 + 4x3 + x4 = 12
4x2 + 3x3 + 8x5 + x6 = 10
x1 , x2 , x3 , x4 , x5 , x6 0.

Suppose that initially we use x1 , x4 and x6 as basic variables.

7. Solve the following LPP using Simplex Method:

Minimize z = 8x1 4x2 ,

subject to 4x1 + 5x2 20, x1 + 3x2 23 and x1 0, x2 unrestricted in sign.

8. Use Simplex method to solve the following LPP:

Maximize z = 2x1 x2 ,

subject to x1 + x2 2, x2 1, x1 x2 1, x1 0 and x2 0.

THE END

You might also like