Sie sind auf Seite 1von 18

# ENGINEERING OPTIMIZATION

th
Tutorial-03 (8 February 2019)
BITS Pilani
Pilani Campus (ME F344 / MF F344)
Instructions

## • Question once displayed, will not be displayed again.

• Once the class is over, the tutorial solutions will be uploaded over CMS

## • Evaluated papers will be distributed in subsequent tutorial.

Instructions

• Text books are allowed but solution manuals are not allowed.

## • Carrying mobile phones to the tutorial is not allowed.

• Maximum of 4 students can make a group. Open consultation is allowed within the
group for solving the tutorial problems.

• If attendance is not recorded through biometric system, evaluation will not be done.

## • 12 or 13 tutorials can be expected, out of which best 8 will be considered.

Evaluation Scheme

## Duration Weightage Nature of

Component
(min.) (%) Component

## Surprise quizzes - 10% Open Book

Evaluative tutorials
50 25% Open Book
Best 8 out of 12 or 13

PROBLEM NO : 1 (20 minutes)

Use the Big-M and Two phase methods to find the maximum value of
Z= 2x1+3x2+x3
Subject to constraints
x1+4x2 +2x3≥8

3x1+2x2≥ 6

x1,x2,x3 ≥0

(20 marks)
Solution 1 (Big-M method)

Solution 1 (Big M method) (contd..)

Solution 1 (Two phase method)

Solution 1 (Two phase method) (Contd..)

Solution 1 (Two phase method) (Contd..)

PROBLEM NO : 2 (20 minutes)

Use the Big-M and Two phase methods to find the maximum value of
Z= 2x1+ 5x2
Subject to constraints
3x1+2x2≥6

2x1+x2≤2

x1,x2≥0

(20 marks)
Solution 2 (Big-M method)

Solution 2 (Two phase method)

Solution 2 (Two phase method) (Contd..)

## No feasible solution for this problem

PROBLEM NO : 3 (10 minutes)
Convert the following LPPs to their respective dual problem and solve them using
graphical method.
1. Maximize Z= 2x1+3x2+x3 2. Maximize Z= 2x1+ 5x2
s.t x1+4x2 +2x3≥8 s.t 3x1+2x2≥6

3x1+2x2≥ 6 2x1+x2≤2

x1,x2,x3 ≥0 x1,x2≥0

(20 marks)
Solution 3 (1)

s.t y1+3y2 ≤ 2

4y1+2y2 ≤ 3

2y1 ≤ 1

y1,y2,y3 ≥0

Solution 3 (2)

s.t 3y1+2y2 ≤ 2

2y1+y2 ≥ 5

y1,y2 ≥0