Optimization: An Introduction

 Optimization : The act of obtaining the best result

under the given circumstances.
 Design, construction and maintenance of
engineering systems involve decision making both at
the managerial and the technological level
 Goals of such decisions :
 to minimize the effort required or
 to maximize the desired benefit
• Optimization : Define as the process of finding the
conditions that give the minimum or maximum value
of a function, where the function represents the effort
required or the desired benefit.
• Maximizing f (x) is equivalent to Minimizing – f (x)
so, Without loss of generality, we deal only with the
Minimization problem.
 Engineering applications of optimization
• Design of structural units such as frames, foundations,
bridges, towers, chimney, dams for minimum cost.
• Minimum weight design of structures for earthquake,
wind and other types of random loading.
• Design of water resources systems for maximum
benefit.
• Optimal production planning, controlling and
scheduling.
• Optimal Allocation of resources or services among
several activities to maximize the benefit.
Basic components of an optimization problem

• An objective function expresses the main aim of the

model which is either to be minimized or maximized.
• A set of unknowns or variables which control the
value of the objective function.
• A set of constraints that allow the unknowns to take
on certain values but exclude others.
The optimization problem is then to:
find values of the variables that minimize or
maximize the objective function while satisfying the
constraints.
Statement of an optimization problem
To find X =  x1 
 
 x2 
. 
 
. 
 xn  Which maximizes f(x)
  Subject to the constraints
gi (x) ≤ 0 i = 1,2,3…m
ij (x) = 0 j = 1,2,3….p
 Where
• x is an n-dimensional vector called the design vector
• f(x) is called the objective function, and
• gi(x) and ij(x) are known as inequality and equality
constraints, respectively.
• This type of problem is called a constrained
optimization problem.
Optimization problems can be defined without any
constraints as well. Such problems are called
unconstrained optimization problems.
 Variables and Constraints

• Variables
These are essential. If there are no variables, we
cannot define the objective function and the problem
constraints.
• Constraints
Even though Constraints are not essential, it has been
argued that almost all problems really do have
constraints.
• In many practical problems, one cannot choose the
design variable arbitrarily.

• Design constraints are restrictions that must be

satisfied to produce an acceptable design.
Constraints can be broadly classified as:
• Behavioral or Functional constraints :
These represent limitations on the behavior and
performance of the system.
• Geometric or Side constraints:
These represent physical limitations on design
variables such as availability and transportability.
 Constraint Surfaces

Consider the optimization problem

To find x =  x1 
 
 x2 
. 
 
. 
 xn  Which maximizes f(x)
 
Subject to the constraints
gi (x) ≤ 0 i = 1,2,3…m
• The set of values of x that satisfy the equation gi(x)
forms a boundary surface in the design space called a
constraint surface.
• The constraint surface divides the design space into
two regions:
 with gi (x) < 0 (feasible region) and
 in which gi (x) > 0 (infeasible region).
The points lying on the hyper surface will satisfy
gi(x) =0.
hypothetical two-dimensional design space where
the feasible region is denoted by hatched lines.

.Free Infeasible region

unacceptable
point
Behavior constraint
g2 ≤0.
Behavior
constraint
g1≤0
Side
constraint
.Free acceptable point
g3 ≥0

Bound
acceptable
point.

Bound
unacceptable
point.
• A design point that lies on one or more than the constraint
surface is called a bound point and the associated constraint is
called an active constraint.
• Design points that do not lie on any constraint surface are
known as free points.
• Design point are classified in to following four types.
1. Free and acceptable point.
2. Free and unacceptable point.
3. Bound and acceptable point.
4. Bound and unacceptable point.
 Objective function
• objective function is the mathematical function one wants
to maximize or minimize, subject to certain constraints.
• Many optimization problems have a single objective
function The two interesting exceptions are:
1. No objective function: The user does not particularly want
to optimize anything so there is no reason to define an
objective function. Usually called a feasibility problem.
2. Multiple objective function: problems with multiple
objectives are reformulated as single-objective problems by
either forming a weighted combination of the different
objectives or by treating some of the objectives by
constraints.
 Classification based on existence of
constraints.

• Constrained optimization problems : which are

subject to one or more constraints.

• Unconstrained optimization problems: in which no

constraints exist.
THANK YOU