EEE 244-8: Optimization.

Slides:



Advertisements
Similar presentations
MATLAB Optimization Greg Reese, Ph.D Research Computing Support Group Miami University.
Advertisements

Ch 2. 6 – Solving Systems of Linear Inequalities & Ch 2
Linear Programming?!?! Sec Linear Programming In management science, it is often required to maximize or minimize a linear function called an objective.
Optimization in Engineering Design 1 Lagrange Multipliers.
Optimization using Calculus
1 Introduction to Linear and Integer Programming Lecture 9: Feb 14.
Optimization Methods One-Dimensional Unconstrained Optimization
Lecture 35 Constrained Optimization
MAE 552 – Heuristic Optimization Lecture 1 January 23, 2002.
Objectives: Set up a Linear Programming Problem Solve a Linear Programming Problem.
An Introduction to Optimization Theory. Outline Introduction Unconstrained optimization problem Constrained optimization problem.
Constrained Optimization Rong Jin. Outline  Equality constraints  Inequality constraints  Linear Programming  Quadratic Programming.
ENCI 303 Lecture PS-19 Optimization 2
84 b Unidimensional Search Methods Most algorithms for unconstrained and constrained optimisation use an efficient unidimensional optimisation technique.
Fin500J: Mathematical Foundations in Finance
Chapter 7 Optimization. Content Introduction One dimensional unconstrained Multidimensional unconstrained Example.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
Systems of Inequalities in Two Variables Sec. 7.5a.
Survey of gradient based constrained optimization algorithms Select algorithms based on their popularity. Additional details and additional algorithms.
1 Optimization Multi-Dimensional Unconstrained Optimization Part II: Gradient Methods.
Warm-Up 3.4 1) Solve the system. 2) Graph the solution.
5 minutes Warm-Up 1) Solve the system. 2) Graph the solution.
Linear Programming Advanced Math Topics Mrs. Mongold.
Optimization unconstrained and constrained Calculus part II.
Monday WARM-UP: TrueFalseStatementCorrected Statement F 1. Constraints are conditions written as a system of equations Constraints are conditions written.
Intro to Linear Programming
Optimization Optimization is the methodology for obtaining the best alternative from all possible ones. Unconstrained optimization has only an objective.
Exam 1 Oct 3, closed book Place ITE 119, Time:12:30-1:45pm
Survey of unconstrained optimization gradient based algorithms
MEGN 536 – Computational Biomechanics Prof. Anthony J. Petrella.
Calculus-Based Optimization AGEC 317 Economic Analysis for Agribusiness and Management.
Optimization in Engineering Design 1 Introduction to Non-Linear Optimization.
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
Inequality Constraints Lecture 7. Inequality Contraints (I) n A Review of Lagrange Multipliers –As we discussed last time, the first order necessary conditions.
1 Introduction Optimization: Produce best quality of life with the available resources Engineering design optimization: Find the best system that satisfies.
Sullivan Algebra and Trigonometry: Section 12.9 Objectives of this Section Set Up a Linear Programming Problem Solve a Linear Programming Problem.
D Nagesh Kumar, IISc Water Resources Systems Planning and Management: M2L2 Introduction to Optimization (ii) Constrained and Unconstrained Optimization.
Optimal Control.
Solver Feature Excel’s KY San Jose State University Engineering 10.
Solver Feature Excel’s KY San Jose State University Engineering 10.
Engineering Problem Solution
deterministic operations research
2.7 Linear Programming Objectives: Use linear programming procedures to solve applications. Recognize situations where exactly one solution to a linear.
Stat 261 Two phase method.
Do Now The cost of renting a pool at an aquatic center is either $30 an hr. or $20 an hr. with a $40 non refundable deposit. Use algebra to find for how.
Systems of Equations and Inequalities
Calculus-Based Solutions Procedures MT 235.
Excel Solver.
fmax = 270, fmin = 0 fmax = 30, fmin = - 30 fmax = 270, fmin = - 270
Constrained Optimization
3-3 Optimization with Linear Programming
Math3H – Unit 2 Day 3 Linear Programming
Linear Programming Objectives: Set up a Linear Programming Problem
AP Calculus BC September 30, 2016.
Chapter 7 Optimization.
L5 Optimal Design concepts pt A
Constrained Optimization
Constrained Optimization – Part 1
Outline Unconstrained Optimization Functions of One Variable
Optimization and Some Traditional Methods
Chapter 7: Systems of Equations and Inequalities; Matrices
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Constrained Optimization – Part 1
Part 4 - Chapter 13.
Constrained Optimization
Chapter 10: Iterative Improvement
Linear Programming.
Part 2 Chapter 7 Optimization
Calculus-Based Optimization AGEC 317
Presentation transcript:

EEE 244-8: Optimization

Introduction to optimization Objective of optimization is to maximize or minimize some function, called the object function f General examples of optimization are: Maximize profit for a company (object function: profit) Minimize production costs of a company (object function: production costs) Engineering examples of optimization are: Maximize gain of an amplifier (object function: gain) Minimize resistive loss in power line from generator to load (object function: resistive loss)

Types of optimization Optimization is mainly of two types: Unconstrained optimization Constrained optimization Example of unconstrained optimization: Minimize or maximize y = 2x2 – 3x => dy/dx = 4x – 3 = 0 => x = 3/4 gives position of minimum or maximum Example of constrained optimization: Minimize or maximize y = 2x2 – 3x in the range of x = 3,5 Solution x = 3/4 will not satisfy this constraint

Practical optimization The object function f may be dependent of many control variables x1, x2, x3….xn Constrained optimization is generally more complex than unconstrained optimization Computational methods are very useful in solving constrained optimization problems

Matlab solution by plotting function Solve the constrained optimization below : Minimize or maximize y = 2x2 – 3x in the range of x = 3,5; % Matlab program to plot function clear x=3:.01:5 y=2*x.^2-3*x; plot(x,y); verify maximum and minimum values from plot

Unconstrained optimization Given an object function f that is dependent on control variables x1, x2, x3….xn; the minimum or maximum at point P is given by the condition: Practical implementation of this formula is called Method of Steepest Descent Solution moves iteratively from point to point until optimum point is reached

Matlab command for unconstrained optimization Given an object function f(x), and starting value x0, the point at which the function reaches a minimum is given by: xmin = fminunc(f,x0) x can be vector of variables x = [x1 x2 …….xn] To obtain point of function maximum, use fminunc command as follows: xmin = fminunc(-f,x0) fmax = -fmin

Matlab example for unconstrained optimization Minimize the function f(x,y) = 2x +3y + x2 + y2 -9, given the initial condition x0 = 2, y0 = 3 % clear f = @ (x) 2*x(1) + 3*x(2) + x(1)^2 + x(2)^2 -9; x0 = [2 3]; xmin = fminunc(f,x0)

Conditions for constrained optimization Given an object function f that is dependent on control variables x1, x2, x3….xn; find the minimum or maximum at point P In addition, we have the inequality constraints or, A*X <= B

Matlab command for constrained optimization Given an object function f(x), and starting value x0, the point at which the function reaches a minimum is given by: xmin = fmincon(f,x0,A,B) with the inequality constraints are A*x <=B To obtain point of function maximum, use fmincon command as follows: xmin = fmincon(-f,x0,A,B) fmax = -fmin

Matlab example for constrained optimization Minimize the function f(x,y) = 2x +3y + x2 + y2 -9, given the initial condition x0 = 2, y0 = 3, and the constraints: x +y <= 3; 2x – 3y <= -5 % clear f = @ (x) 2*x(1) + 3*x(2) + x(1)^2 + x(2)^2 -9; A=[1 1; 2 -3]; B=[3;-5]; x0 = [2 3]; xmin = fmincon(f,x0,A,B)