Scribd
Upload
91 views2 pages

Btech All 5 Sem Optimization in Engineering Hssm3302 2020

The document is a past exam paper for an optimization in engineering course from BPUT University. It contains 8 questions testing various concepts in linear programming, nonlinear programming, and queuing theory. Specifically, it covers topics like the simplex method, duality, Lagrange multipliers, transportation problems, and solution methods for nonlinear optimization problems.

Uploaded by

CHANDAN SAHOO
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
91 views2 pages

Btech All 5 Sem Optimization in Engineering Hssm3302 2020

The document is a past exam paper for an optimization in engineering course from BPUT University. It contains 8 questions testing various concepts in linear programming, nonlinear programming, and queuing theory. Specifically, it covers topics like the simplex method, duality, Lagrange multipliers, transportation problems, and solution methods for nonlinear optimization problems.

Uploaded by

CHANDAN SAHOO
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

http://www.bputonline.

com

Registration No :

Total Number of Pages : 02 B.Tech


HSSM3302
5th Semester Back Examination 2019-20
OPTIMIZATION IN ENGINEERING
BRANCH : AEIE, AUTO, CHEM, CIVIL, CSE, ECE, EEE, EIE, ELECTRICAL, ENV, ETC,
FASHION, FAT, IEE, IT, ITE, MANUFAC, MANUTECH, MARINE, MECH, METTA,
MINERAL, MINING, MME, PLASTIC, TEXTILE
Time : 3 Hours
Max Marks : 70
Q.CODE : HB062
Answer Question No.1 which is compulsory and any FIVE from the rest.
The figures in the right hand margin indicate marks.

Q1 Answer the following questions : (2 x 10)


a) Define a degenerate basic feasible solution.
b) Write the dual of the given problem
Maximize = 3 + 5 ,
subject to 2 + 6 ≤ 50, 3 + 2 ≤ 35, 5 − 3 ≤ 10,
, ≥ 0.
c) Write the value of Golden Ratio.
d) What is an Integer Programming problem?
e) What are the basic characteristic of a queuing system?
f) Determine local maximum and local minimum of the function
( )= − 3 + 3.
g) Why we use Dual Simplex method?
h) Determine Hessian matrix of ( ) = + 2 + − − − .
i) State positive definite Matrix.
j) State slack variable and surplus variable.

Q2 a) Solve the following linear programming problem graphically (5)


Maximize = 5 + 3 ,
Subject to 3 + 5 ≤ 15, 5 + 2 ≤ 10,
, ≥ 0.
b) Analyze the given linear programming problem by using simplex method: (5)
Maximize = 2 + 5 ,
Subject to + 4 ≤ 24, 3 + ≤ 21, + ≤ 9,
, ≥ 0.

Q3 a) Minimize ( ) = 4 + − 7 + 14 within [0,1] using Golden Section Search (5)


method with stopping tolerance = .15 .
b) Develop the solution of the following nonlinear programming problem by using (5)
Lagrange Multiplier Method:
Maximize = 4 + 8 − − ,
Subject to + = 2,
, ≥ 0.

http://www.bputonline.com
http://www.bputonline.com

Q4 a) Explain briefly the various steps involved in Stepping Stone method. (5)
b) Discuss Dual Simplex method in order to the following problem: (5)
Maximize = −3 − 2 ,
Subject to + ≥ 1, + ≤ 7, + 2 ≥ 10, ≤ 3,
, ≥0.

Q5 a) Describe the Characteristics of the Queuing system. (5)


b) Solve the following by Revised simplex method (5)
Max Z = 4 − − 2
Subject to 2 − 3 + 2 ≤ 12,−5 + 2 + 3 ≥ 4,−3 +2 = 1 where
, , ≥0.

Q6 Discuss various steps involved in order to solve the given nonlinear optimization (10)
problem by using Kuhn-Tucker method:
Minimize ( , ) = −4 + − 6 , subject to + ≤ 3, −2 + ≤ 2,
and , ≥ 0.

Q7 Evaluate an initial basic feasible solution to the following transportation problem (10)
using north-west corner rule
To Available
3 4 6 8 9 20
From 2 10 1 5 8 30
7 11 20 40 3 15
2 1 9 14 16 13
Demand 40 6 8 18 6

Q8 Write short answer on any TWO : (5 x 2)


a) Discuss various steps involved in Revised Simplex method.
b) Describe the Characteristics of the Queuing system
c) Discuss various steps involved in Golden Fibonacci method.

http://www.bputonline.com

You might also like