Scribd
Upload
47 views3 pages

Ec363 Optimization Techniques, January 2022

1. The document discusses various optimization techniques including convex/concave functions, simplex method, transportation problem, minimum spanning trees, shortest path algorithms, and genetic algorithms. 2. Questions are provided involving solving optimization problems using techniques like simplex method, northwest corner rule, VAM method, MODI method, Dijkstra's algorithm, and algorithms like Newton-Raphson method and steepest descent. 3. Additional questions define terms like crossover and mutation and explain the working principle of genetic algorithms and fitness functions.

Uploaded by

Options
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
47 views3 pages

Ec363 Optimization Techniques, January 2022

1. The document discusses various optimization techniques including convex/concave functions, simplex method, transportation problem, minimum spanning trees, shortest path algorithms, and genetic algorithms. 2. Questions are provided involving solving optimization problems using techniques like simplex method, northwest corner rule, VAM method, MODI method, Dijkstra's algorithm, and algorithms like Newton-Raphson method and steepest descent. 3. Additional questions define terms like crossover and mutation and explain the working principle of genetic algorithms and fitness functions.

Uploaded by

Options
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/ 3

F --=ry

030008c363092002
ffi
RegNo.:
$__--)..-
APJ ABDI]L KALAM TECHNOLOGICAL TTNIVERSITY
Fiffi Semester B.Tech Degree (S,FE) Examination January 2022 Q0l5

Course Code: 8C363


Course Name: OPTIMIZATION TECHMQUES
Max. Marks: 100 Duration: 3 Hours

PART A
Answer any twofull qaestions, each carries 15 morks. Marks
I a) Define convex and concave function. Determine whether the following function (5)

are convex or concave. (Df (x) : e * iiX(x): 8x2

b) State and prove the necessary and sufficient condition for the relative minimum (10)

of a function of a single variable.


a) Solve using simplex method (8)
Maximise Z=5x1+ 3x2 subject to: x1 * x2 ( 2,5x1+ 2x2 < 10, 3xr * 8x2 < 12 ,
X1 ,X2) $.
b) Solve the following problem graphically. Maximise Z: 60x1 + 40xz Q)
subject to :2x1+ *, . 60 , x1 <25 ,xz < 35 , Xr , Xz ) 0
3a) Solve using Dual Simplex method : Minimise Z:2x1* )v, (8)
subjectto : 2x1+ 4xz > 1,x1 + 2xz > 1,2x1* x2 i l, Xl, xz > 0

b) Find the extreme points of the function f (x,xr) = rr3 * xrt + 2xr' + 4x.2 + 6. Q)

PART B
Answer any two full questions, mch carries 15 mtrks.
4 a) Find the initial basic feasible solution to the following transportation problem (8)
usingVAM niethod.

A B c Supply

L 2 7 4 5

2 3 3 1 8

3 5 4 7 7

4 1 5 2 L4

Demand 7 9 18

Page 1 of 3
030008C363W2002

b) Find Basie Feasible Solution using North-West corner rule (7)

D1 D2 D3 D4 D5 ?1

o1 20 18 18 2t 19 100

02 2L 22 23 20 24 L25

o3 18 19 2l 18 19 L75

bj 60 80 85 105 70

5 a) Solve the transportation problem using MODI method (10)

(. w1 w2 W3 w4 Supply

P1 190 300 s00 100 70

P2 700 300 400 500 90

P3 400 100 600 200 180

Demand 50 80 70 TN

b) Solve the following game bythe principle of dominance (5)

[t lo e t4l
Ito n 8, nl
Lr t2 14 l3j
6a) Find the minimum spanning tree to the following network by PRIM'S algorithm. (8)

b) Solve using Djikstra's shortest path algorithm taking node I to 7 (7)

Page 2 of3
0ffi

.{n_
PART C
Answ uy twofiil qg;tiaprs, reh ca*ies 20 trur*s.

t 7 a) Fird the minimmr of the fi.rnctim f(x)=0.65-;q'75, -0.65xtan-,lushg (t0)


l+x. x
-Ne*tun_R son nleftod wi& dre starting pint rr =0.l.Use a=0.Olfor
ckkingthe convelgerrce
b) Miaindse f{xr,xr)= rt - xz +2xr' + xr2 +2xrx, usingsteepest lhec€ffi (10)
fo)
. mednd starti*gfum *e poirtrloJ-tt*o Iterdions)

8 a) Minimise/ (x) = x' *Tx io the interval [o,s] rv dro Fibonacci search M€ftod. (10)

(Choose n: 3).
b) ffiethe following terms with suit$le applications: (10)
G) Cmss over (ii) Mrncion
9 a) E:rybin fte working pinciple used in Genetic Algorithm. (t0)
=
'€gl t
bl-r*a fuess fimcti<ln in Geletic atgorithms (':)
't:-
****
:t:t**
'.:
-

,
+

PaSe 3 of3

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy