University of Baghdad Dr.
Ibraheem Kasim
College of Engineering Final Year Examination
Electrical Eng. Dept. 1st Attempt
Higher Studies / M. Sc. Date: 2014/2015
Optimization Techniques
Attempt all questions and all questions carry equal marks
Q1-a: Match the following equations and their characteristics:
2 2
f =( 2 x 1−2 ) +(x 2−2) saddle point at the origin
2 2
f =−( x 1−1 ) −(x 2−2) no minimum
f =4 x 1−3 x 2 +2 relative maximum at (1,2)
f =x 1 x 2 inflection point at the origin
3
f =x 1 relative minimum at (1,2)
Q1-b: Find the admissible and constrained variations at the point X = {0, 4}T for the
following problem:
Minimize f =x 21+ ¿
Subject to
2 ❑ ❑
−x 1+ x2 =4
Q2: In the tableau for the maximization problem below, the values of the six constants α1,
α2, α3 , β, ρ1, ρ2 are unknown (assume there are no artificial variables):
State restrictions on the six unknowns α1, α2, α3 , β, ρ1, ρ2 that would make the following
statements true about the given tableau:
(a) The current solution is optimal but an alternate optimum exists.
(b) The current solution is infeasible. (State which variable.)
(c) One of the constraints is inconsistent.
(d) The current solution is a degenerate basic feasible solution. (Which variable causes
degeneracy?)
(e) The current solution is feasible but the problem has no finite optimum.
(f) The current solution is the unique optimum solution.
Q3-a: A manufacturer produces three machine parts, A, B, and C. The raw material costs of
parts A, B, and C are $5, $10, and $15 per unit, and the corresponding prices of the
finished parts are $50, $75, and $100 per unit. Part A requires turning and drilling
operations, while part B needs milling and drilling operations. Part C requires turning
and milling operations. The number of parts that can be produced on various machines
per day and the daily costs of running the machines are given below:
Formulate the problem of maximizing the profit .
Q3-b: Find the minimum of the function f = λ 5 − 5λ3 − 20λ + 5 by Dichotomous search in
the interval (0, 5) with δ = 0.0001.
Q4: An electric power of 100MW generated at a hydroelectric power plant is to be
transmitted 400 km to a stepdown transformer for distribution at 11 kV. The power
dissipated due to the resistance of conductors is i2c−1, where i is the line current in amperes
and c is the conductance in mhos. The resistance loss, based on the cost of power delivered,
can be expressed as 0.15i2c−1 dollars. The power transmitted (k) is related to the
transmission line voltage at the power plant (e) by the relation k = √3ei, where e is in
kilovolts. The cost of conductors is given by 2c millions of dollars, and the investment in
equipment needed to accommodate the voltage e is given by 500e dollars. Find the values of
e and c to minimize the total cost of transmission using Newton’s method (one iteration
only).
Q5: Minimize
f(X) = 9 x 21 + 6 x 22 + x 23-18 x1-12 x2 -6x3-8
Subject to
x1+2x2+x3 ≤ 4
xi ≥ 0 i =1, 2, 3
with the starting point X1 = {0 0 0 }T. Complete one step of sequentinal linear
programming method.
Q6-a: Find the minimum of the following function using simulated annealing:
f = x5 − 5 x3 − 20 x + 5
Assume suitable parameters and show detailed calculations for 2 iterations.
Q6-b:
1. Which of the following statement(s) is/are true?
i. Genetic Algorithm is a randomised parallel search algorithm, based on the
principles of natural selection, the process of evolution.
ii. GAs are exhaustive, giving out all the optimal solutions to a given problem.
iii. GAs are used for solving optimization problems and modeling evolutionary
phenomena in the natural world.
iv. Despite their utility, GAs remain a poorly understood topic.
Your answer is : (a) i, ii & iii only, (b) ii, iii & iv only , (c) i, iii & iv only , (d) all of
the above
2. Which of the following(s) is/are found in Genetic Algorithms?
i. evolution
ii. selection
iii. reproduction
iv. mutation
Your answer is : (a) i & ii only , (b) i, ii & iii only , (c) ii, iii & iv only , (d) all of the above
3. If crossover between chromosome in search space does not produce significantly
different offsprings, what does it imply? (if offspring consist of one half of each
parent)
i The crossover operation is not successful.
ii Solution is about to be reached.
iii Diversity is so poor that the parents involved in the crossover operation are
similar.
iv The search space of the problem is not ideal for GAs to operate.
Your answer is : (a) ii, iii & iv only, (b) ii & iii only, (c) i, iii & iv only, (d) all of the above
4. Which of the following comparison is true?
Your answer is :
(a) In the event of restricted access to information, GAs win out in that they require much
fewer information to operate than other search.
(b) Under any circumstances, GAs always outperform other algorithms.
(c) The qualities of solutions offered by GAs for any problems are always better than those
provided by other search.
(d) GAs could be applied to any problem, whereas certain algorithms are applicable to
limited domains.
Good Luck