Engineering Optimization (ME F344 and ME F
Department of Mechanical
Engineering
BITS Pilani K. K. Birla Goa campus
Instructor in charge: Dr. Biswajit Das
Dr. Manoj Kumar Pandey
BITS Pilani Goa campus
Transition from Graphical to Algebraic Solution
Graphical Method Algebraic Method
Plot all constraints, solution space Represent the solution space in the
has infinity of feasible solutions equation form, the system has
infinity of feasible solution.
Candidates for the optimum Candidates for the optimum
solution are given by a finite solution are the finite number of
number of feasible corner points basic feasible solution
Using the objective function Using the objective function
determine the optimal solution. determine the optimal solution.
Manoj Kumar Pandey, OPTIMIZATION
Basic Variables, Basic Feasible Solutions
Consider an LPP (in standard form) with m constraints and n
variables.
We assume m n. We choose n – m variables and set them equal to
zero. Thus we will be left with a system of m equations in m
variables. If this system has a unique solution, this solution is called
a basic solution.
Further if it is feasible, it is called a Basic Feasible Solution (BFS).
Note that a system may have a maximum of nCm basic solutions
Dr. Manoj Kumar Pandey
The n – m variables set to zero are called nonbasic and the m
variables which we are solving for are known as basic
variables.
Thus a basic solution is of the form x = (x1, x2, …, xn) where
n – m “components” are zero and the remaining m variables
form the unique solution of the square system (formed by the
m constraint equations).
Dr. Manoj Kumar Pandey
Dr. Manoj Kumar Pandey
Dr. Manoj Kumar Pandey
Dr. Manoj Kumar Pandey
(2, 0, 4, 0)
(6/7, 12/7, 0,
0)
Manoj Kumar Pandey, OPTIMIZATION 8
Graphical Solution
Feasible Region (PF)
Manoj Kumar Pandey, OPTIMIZATION 9
Set: A set is described as a “well-defined” collection of
objects. These objects are called the elements or
members of the set. Objects can be anything: numbers,
people, other sets, etc.
Example: A = {red, blue, yellow, green, purple} is well-defined since it is clear
what is in the set what is not.
Dr. Manoj Kumar Pandey
Convex Set: A set is said to be convex if the line
segment joining any two points in S lies in the set.
that is:
if X1 and X2 S
then
(1-) X1+ X2, 0 ≤ ≤ 1 S.
Consider the figures (a) – (d) below:
Dr. Manoj Kumar Pandey
Dr. Manoj Kumar Pandey
Dr. Manoj Kumar Pandey
Show that
(i) The intersection of two convex sets is a convex set.
Dr. Manoj Kumar Pandey
Show that
(ii) Union of two convex sets need not be convex.
Dr. Manoj Kumar Pandey
Dr. Manoj Kumar Pandey
Dr. Manoj Kumar Pandey
alternative optimal solution.
Dr. Manoj Kumar Pandey
Alternative or multiple optimal solutions
Dr. Manoj Kumar Pandey
Show that
(iii) The feasible region of a LPP is a convex set
Dr. Manoj Kumar Pandey
Dr. Manoj Kumar Pandey
