B.TechSemester 52022-23Optimization TechniqueKEE055

Optimization Technique (KEE055) - AKTU Question Paper 2022-23

B.Tech · Semester 5 · Free PDF Download

This is the official AKTU Optimization Technique Previous Year Question Paper for B.Tech Semester 5, academic session 2022-23. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.

Course:B.Tech

Semester:Semester 5

Session:2022-23

University:AKTU / UPTU

Rate this paper

Questions Asked in 2022-23

Optimization Technique (KEE055) — complete question paper

Section AAttempt all questions in brief. 2 x 10 = 20

a
What is a merit function?
b
What is a quadratic form?
c
Define the infeasibility form
d
Explain Methods of finding ini tial Basic Feasible Solutions
e
What is an interval of uncertainty?
f
Why is the scaling of variables important?
g
Give the definition of genetic algorithm
h
Explain the types of simulation. i. Why economic load dispatch is required for power system? j. Write the importance of maint enance scheduling of machines

Section BAttempt any three of the following: 10x 3 = 30

a
Find the maximum of the function f (X) = 2x 1 + x2 + 10 subject to g( X ) = x1 + 2x 22 = 3 using the Lagrange multiplier method. Also find the effect of changing the right-hand side of the constraint on the optimum value of f
b
What is simplex? Describe the simplex method of solving line ar programming problem
c
Explain the Dichotomous search. Find the minimum of f = x(x − 1.5) in the interval (0.0, 1.00) to within 10% of the exact value
d
Explain in detail about the bas ic step of CPM/PERT and advan tages and disadvantages of PERT and CPM
e
Briefly explain about the maintenance scheduling of motor in manufacturing industry

Section CAttempt any one part of the following: 10x 1 = 10

a
State the various methods availabl e for solving a multivariable optimization problem with equality constraints
b
State the Kuhn–Tucker conditions. What is a convex programming problem? What is its significance?
a
Use the simplex method to s olve the following LP problem. Maximize Z = 3x1 + 5x2 + 4x3 subject to the constraints (i) 2x1 + 3x2 ≤ 8, (ii) 2x2 + 5x3 ≤ 10, (iii) 3x1 + 2x2 + 4x3 ≤ 15 and x1, x2, x3 ≥ 0
b
Find the initial basic feasible solution for the following t ransportation problem, using North-West Corner Rule method. sources D1 D2 D3 supply Demand 8 10 27
a
What is interval halving met hod? Explain its procedure to solve optimization problem with suitable example
b
State the necessary and suffici ent conditions for the unconstra ined minimum of a function. Define Unimodal function
a
Find the critical path and ca lculate the slack time for the following network
b
Write the short notes on
b
genetic algorithm (GA) operator
c
compare GA with traditional method
a
Consider two units of a plant that have fuel costs of Determine the economic operating schedule and the corresponding cost of generation for the demand of 180 MW
b
Explain in brief about the spe ed control method by fuzzy logic controller

Question text is extracted from the official AKTU question paper PDF above. Hindi translations are omitted — every question is printed in English in the original paper. Last verified: 2026-08-23.

More B.Tech Semester 5 (2022-23) Papers

Other subjects from same semester and session

Electronics Switching2022-23 Computer Integrated Manufacturing2022-23 Modern Construction Materials2022-23 Object Oriented System Design With C++2022-23 Digital Signal Processing2022-23 Finite Element Methods2022-23 Advance Digital Design Using Verilog2022-23 Business Intelligence And Analytic2022-23

View all B.Tech Semester 5 2022-23 papers →

Syllabus & More PYQs

Paper solve karne se pehle unit-wise syllabus dekh lo

📘 Optimization Techniques — Unit-wise SyllabusBEE055 AKTU 3rd Year Syllabus AKTU 3rd Year PYQs — All Branches ELECTRICAL 3rd Year Syllabus EEE 3rd Year Syllabus ELECTRICAL COMPUTER ENGG 3rd Year Syllabus