Solving Optimization Problems

Debasis Samanta

IIT Kharagpur
[email protected]

05.03.2024

Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 1 / 22

Introduction to Solving Optimization Problems

Today’s Topics
Concept of optimization problem
Defining an optimization problem
Various types of optimization problems
Traditional approaches to solve optimization problems
Limitations of the traditional approaches

Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 2 / 22

Concept of optimization problem

Optimization : Optimum value that is either minimum or maximum

value.
y = F (x)

Example:
2x − 6y = 11
or
y = (2x − 11) ÷ 6
Can we determine an optimum value for y ?
Similarly, in the following case
3x + 4y ≥ 56.

These are really not related to optimization problem!

Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 3 / 22

Defining an optimization problem
Suppose, we are to design an optimal pointer made of some material with
density ρ. The pointer should be as low weight as possible, with a
desirable strength (i.e. sustainable to mechanical breakage) and the
deflection of pointing at end should be negligible.
The task is to select the best pointer out of all possible pointers.

Diameter d

Length l

Suppose, s is the strength of the pointer.

Mass of the stick is denoted by

2
M = 13 Π d2 ∗ l ∗ ρ = 1
12 Π ∗ d2 ∗ l ∗ ρ
Deflection : δ = f1 (d, l, ρ)
Strength : s = f2 (d, l, ρ)
Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 4 / 22
Defining an optimization problem

The problem can be stated as

Objective function
1
Minimize M = 12 Π ∗ d2 ∗ l ∗ ρ
Subject to
δ ≤ δth , where δth = allowable deflection
s ≥ sth , where sth = required strength
and
dmin ≤ d ≤ dmax
lmin ≤ l ≤ lmax

Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 5 / 22

Defining Optimization Problem

An optimization problem can be formally defined as follows:

Maximize (or Minimize)
yi = fi (x1 , x2 , · · · , xn )
where i = 1, 2 · · · k, k ≥ 1
Subject to
gi (x1 , x2 , · · · xn ) ROPi ci
where i = 1, 2, ..., j, j ≥ 0. ROPi denotes some relational operator
and ci = 1, 2, · · · j are some constants.
and
xi ROP di , for all i=1,2...n (n ≥ 1)
Here, xi denotes a design parameter and di is some constant.

Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 6 / 22

Some Benchmark Optimization Problems

Exercises: Mathematically define the following optimization problems.

Traveling Salesman Problem
Knapsack Problem
Graph Coloring Problem
Job Machine Assignment Problem
Coin Change Problem
Binary search tree construction problem

Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 7 / 22

Types of Optimization Problem

Unconstrained optimization problem

Problem is without any functional constraint.

Example:
Minimize y = f (x1 , x2 ) = (x1 − 5)2 + (x2 − 3)3
where x1 , x2 ≥ 0

Note: Here, gj = NULL

Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 8 / 22

Types of Optimization Problem

Constrained optimization problem

Optimization problem with at one or more functional constraint(s).

Example:
Maximize y = f (x1 , x2 , · · · , xn )

Subject to
gi (x1 , x2 , · · · , xni ) ≥ ci
where i = 1, 2, · · · , k and k > 0
and
x1 , x2 , · · · , xn are design parameters.

Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 9 / 22

Types of Optimization Problem

Integer Programming problem

If all the design variables take some integer values.

Example:
Minimize y = f (x1 , x2 ) = 2x1 + x2
Subject to
x1 + x2 ≤ 3
5x1 + 2x2 ≤ 9
and
x1 , x2 are integer variables.

Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 10 / 22

Types of Optimization Problem

Real-valued problem
If all the design variables are bound to take real values.

Mixed-integer programming problem

Some of the design variables are integers and the rest of the variables take
real values.

Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 11 / 22

Types of Optimization Problem

Linear optimization problem

Both objective functions as well as all constraints are found to be some
linear functions of design variables.
Example:
Maximize y = f (x1 , x2 ) = 2x1 + x2
Subject to
x1 + x2 ≤ 3
5x1 + 2x2 ≤ 10
and
x1 , x2 ≥ 0

Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 12 / 22

Types of Optimization Problem

Non-linear optimization problem

If either the objective function or any one of the functional constraints are
non-linear function of design variables.
Example:
Maximize y = f (x1 , x2 ) = x12 + 5x23
Subject to
x14 + 3x22 ≤ 629
2x13 + 4x23 ≤ 133
and
x1 , x2 ≥ 0

Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 13 / 22

Traditional approaches to solve optimization
problems

Optimization Methods

Linear Programming Non linear Programming

Specialized Algorithm
Method Method

Graphical Method Dynamic Programing

Simplex Method Branch & Bound
Greedy Method
Single Variable Multi Variable
Divide & Conquer

Numerical Analytical Constrained Unconstrained

Method Method Optimization Optimization

Unrestricted method Random Walk

Exhaustive method Univeriate Method
Fibonacci method Pattern Search
Elimination Method Interpolation Method Lagrangian method Steepest Descent
Conjugate Gradient
Unrestricted method Quadratic Quasi Newton
Exhaustive method Cubic Variable Match
Fibonacci method Direct root
Dichotomous Search
Golden Section method

Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 14 / 22

Example : Analytical Method

Suppose, the objective function: y = f (x). Let f (x) be a polynomial of

degree m and (m > 0)
If y ′ = f ′ (x) = 0 for some x = x ∗ , then we say that
y is optimum (i.e. either minimum or maximum point exist) at the point
x = x ∗.
If y ′ = f ′ (x) ̸= 0 for some x = x ∗ , then we say that
there is no optimum value at x = x ∗ (i.e. x = x ∗ is an inflection point)
An inflection point is also called a saddle point.

Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 15 / 22

Example : Analytical Method

Note:
An inflection point is a point, that is, neither a maximum nor a minimum
at that point.
Following figure explains the concepts of minimum, maximum and saddle
point.

Maximum
Saddle Points

Minimum

x1 * x2*
x

Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 16 / 22

Example : Analytical Method

Let us generalize the concept of ”Analytical method”.

If y = f (x) is a polynomial of degree m, then there are m number of
candidate points to be checked for optimum or saddle points.
Suppose, y n is the nth derivative of y.
To further investigate the nature of the point, we determine (first
non-zero) (n − th) higher order derivative
y n = f n (x = x ∗ )
There are two cases.
Case 1:
If y n ̸= 0 for n=odd number, then x ∗ is an inflection point.
Case 2:
If y n = 0 for n = odd number, then there exist an optimum point at x ∗ .

Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 17 / 22

Example : Analytical Method

In order to decide the point x ∗ as minimum or maximum, we have to find

the next higher order derivative, that is y n+1 = f n+1 (x = x ∗ ).
There are two sub cases may be:
Case 2.1:
If y n+1 = f n+1 (x = x ∗ ) is positive then x is a local minimum point.
Case 2.2:
If y n+1 = f n+1 (x = x ∗ ) is negative then x is a local maximum point.

x1 * z1* x2* z2 * x3* z3* x4* z4*

If y n+1 = f n+1 (x = x ∗ ) = 0, then we are to repeat the next higher order

derivative.
Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 18 / 22
Question
y = f (x)
d 2y ∗
dx = +ve ⇒ x = x1
d 4y
dx = −ve ⇒ x = x2∗
d 6y
dx = +ve ⇒ x = x3∗

Optimal Solution
x=x2*

x=x1* x=x3* x

Is the analytical method solves optimization problem with multiple input

variables?
If ”Yes”, than how?
If ”No”, than why not?
Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 19 / 22
Exercise

Determine the minimum or maximum or saddle points, if any for the

following single variable function f (x)
2
f (x) = x2 + 125
x
for some real values of x.

Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 20 / 22

Duality Principle

Principle
A minimization (maximization) problem is said to have dual problem if it
is converted to the maximization (minimization) problem.
The usual conversion from maximization ⇔ minimization
y = f (x) ⇔ y ∗ = −f (x)
y = f (x) ⇔ y ∗ = f (x)
1

Maximization Problem
y = f(x)

y x
Minimization Problem
y* = f(x)

Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 21 / 22

Limitations of the traditional optimization approach

Computationally expensive.
For a discontinuous objective function, methods may fail.
Method may not be suitable for parallel computing.
Discrete (integer) variables are difficult to handle.
Methods may not necessarily adaptive.

Soft Computing techniques have been evolved to address the above

mentioned limitations of solving optimization problem with traditional
approaches.

Debasis Samanta (IIT Kharagpur) Soft Computing Applications (IT60108) 05.03.2024 22 / 22