Introduction and Basic Concepts (ii) Optimization Problem and Model Formulation

D Nagesh Kumar, IISc

Optimization Methods: M1L2

Objectives

To study the basic components of an optimization problem. Formulation of design problems as mathematical programming problems.

D Nagesh Kumar, IISc

Optimization Methods: M1L2

Introduction - Preliminaries

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.

D Nagesh Kumar, IISc

Optimization Methods: M1L2

Introduction (contd.)

The optimization problem is then to:

find values of the variables that minimize or maximize the objective function while satisfying the constraints.

D Nagesh Kumar, IISc

Optimization Methods: M1L2

Objective Function

As already defined the objective function is the mathematical function one wants to maximize or minimize, subject to certain constraints. Many optimization problems have a single objective function (When they don't they can often be reformulated so that they do). The two interesting exceptions are:

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.

Multiple objective functions. In practice, 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.

D Nagesh Kumar, IISc

Optimization Methods: M1L2

Statement of an optimization problem

Subject to the constraints gi(X) <= 0 , lj(X) = 0 ,

D Nagesh Kumar, IISc

Optimization Methods: M1L2

Statement of an optimization problem

where X is an n-dimensional vector called the design vector f(X) is called the objective function, and gi(X) and lj(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.

D Nagesh Kumar, IISc

Optimization Methods: M1L2

Objective Function Surface

If the locus of all points satisfying f(X) = a constant c is considered, it can form a family of surfaces in the design space called the objective function surfaces. When drawn with the constraint surfaces as shown in the figure we can identify the optimum point (maxima). This is possible graphically only when the number of design variable is two. When we have three or more design variables because of complexity in the objective function surface we have to solve the problem as a mathematical problem and this visualization is not possible.

D Nagesh Kumar, IISc

Optimization Methods: M1L2

Objective function surfaces to find the optimum point (maxima)

D Nagesh Kumar, IISc

Optimization Methods: M1L2

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.

10

D Nagesh Kumar, IISc

Optimization Methods: M1L2

Constraints (contd.)

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, fabricability, and transportability.

11

D Nagesh Kumar, IISc

Optimization Methods: M1L2

Constraint Surfaces

Consider the optimization problem presented earlier with only inequality constraints gi(X) . 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: one with gi(X) < 0 (feasible region) and the other in which gi(X) > 0 (infeasible region). The points lying on the hyper surface will satisfy gi(X) =0.

12

D Nagesh Kumar, IISc

Optimization Methods: M1L2

The figure shows a hypothetical two-dimensional design space where the feasible region is denoted by hatched lines.
Behavior constraint g2 0

Infeasible region

Side constraint g3 0

Feasible region

.
Bound acceptable point.

Behavior constraint g1 0

Free acceptable point Free unacceptable point Bound unacceptable point.

Formulation of design problems as mathematical programming problems

The following steps summarize the procedure used to formulate and solve mathematical programming problems.
1.

2.

Analyze the process to identify the process variables and specific characteristics of interest i.e. make a list of all variables. Determine the criterion for optimization and specify the objective function in terms of the above variables together with coefficients.

14

D Nagesh Kumar, IISc

Optimization Methods: M1L2

3.

Develop via mathematical expressions a valid process model that relates the input-output variables of the process and associated coefficients.
a) b) c)

Include both equality and inequality constraints Use well known physical principles Identify the independent and dependent variables to get the number of degrees of freedom

3.

If the problem formulation is too large in scope:

break it up into manageable parts/ or simplify the objective function and the model

4. 5.

Apply a suitable optimization technique for mathematical statement of the problem. Examine the sensitivity of the result to changes in the coefficients in the problem and the assumptions.

Thank You

16

D Nagesh Kumar, IISc

Optimization Methods: M1L2