Optimization Theory O Professor: Dr. Sahand Daneshvar O Student’s Name: Milad Kermani (125512) M.S student of Mechanical Engineering Department Eastern.

Slides:



Advertisements
Similar presentations
Section 9.1 – Sequences.
Advertisements

Cyclic Coordinate Method
Line Search.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Linear Inequalities and Linear Programming Chapter 5 Dr.Hayk Melikyan/ Department of Mathematics and CS/ Linear Programming in two dimensions:
Ch 3.6: Variation of Parameters
Optimization 吳育德.
Arithmetic Sequences and Series
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Thursday, April 25 Nonlinear Programming Theory Separable programming Handouts: Lecture Notes.
Nonlinear programming: One dimensional minimization methods
MIT and James Orlin © Nonlinear Programming Theory.
ENGR 351 Numerical Methods Instructor: Dr. L.R. Chevalier
1 More about the Confidence Interval of the Population Mean.
6. Linear Programming (Graphical Method) Objectives: 1.More than one solution 2.Unbounded feasible region 3.Examples Refs: B&Z 5.2.
Sequencing Problem.
Name: Mehrab Khazraei(145061) Title: Penalty or Exterior penalty function method professor Name: Sahand Daneshvar.
1 Shortest Path Calculations in Graphs Prof. S. M. Lee Department of Computer Science.
Chapter 5 Number Theory © 2008 Pearson Addison-Wesley.
Copyright © 2011 Pearson Education, Inc. Slide A sequence in which each term after the first is obtained by adding a fixed number to the previous.
Instructor: Prof.Dr.Sahand Daneshvar Presented by: Seyed Iman Taheri Student number: Non linear Optimization Spring EASTERN MEDITERRANEAN.
Introduction to Unit 1: Patterns & Sequences Mathematics 12 Foundations.
The Dual Problem: Minimization with problem constraints of the form ≥
Auction Seminar Optimal Mechanism Presentation by: Alon Resler Supervised by: Amos Fiat.
HPC Technology Track: Foundations of Computational Science Lecture 1 Dr. Greg Wettstein, Ph.D. Research Support Group Leader Division of Information Technology.
Chapter 7 Optimization. Content Introduction One dimensional unconstrained Multidimensional unconstrained Example.
Stochastic Linear Programming by Series of Monte-Carlo Estimators Leonidas SAKALAUSKAS Institute of Mathematics&Informatics Vilnius, Lithuania
Preview Objectives Definition of Work Chapter 5 Section 1 Work.
Department of Electrical Engineering, Southern Taiwan University Robotic Interaction Learning Lab 1 The optimization of the application of fuzzy ant colony.
Department Of Industrial Engineering Duality And Sensitivity Analysis presented by: Taha Ben Omar Supervisor: Prof. Dr. Sahand Daneshvar.
Variational Data Assimilation - Adjoint Sensitivity Analysis Yan Ding, Ph.D. National Center for Computational Hydroscience and Engineering The University.
Linear Programming Erasmus Mobility Program (24Apr2012) Pollack Mihály Engineering Faculty (PMMK) University of Pécs João Miranda
EASTERN MEDITERRANEAN UNIVERSITY Department of Industrial Engineering Non linear Optimization Spring Instructor: Prof.Dr.Sahand Daneshvar Submited.
© Houghton Mifflin Harcourt Publishing Company Preview Objectives Definition of Work Chapter 5 Section 1 Work.
Unit 5 – Series, Sequences, and Limits Section 5.2 – Recursive Definitions Calculator Required.
Sampling distributions rule of thumb…. Some important points about sample distributions… If we obtain a sample that meets the rules of thumb, then…
12/2/20151 GC16/3011 Functional Programming Lecture 2 The Lambda Calculus: A Simple Introduction.
Which rectangle do you like most?
Example Ex. Find Sol. So. Example Ex. Find (1) (2) (3) Sol. (1) (2) (3)
DESIGN OF SEQUENTIAL CIRCUITS by Dr. Amin Danial Asham.
Dr. Omar Al Jadaan Assistant Professor – Computer Science & Mathematics General Education Department Mathematics.
L22 Numerical Methods part 2 Homework Review Alternate Equal Interval Golden Section Summary Test 4 1.
D Nagesh Kumar, IIScOptimization Methods: M6L5 1 Dynamic Programming Applications Capacity Expansion.
1 Motion Fuzzy Controller Structure(1/7) In this part, we start design the fuzzy logic controller aimed at producing the velocities of the robot right.
© Houghton Mifflin Harcourt Publishing Company Preview Objectives Definition of Work Chapter 5 Section 1 Work.
Optimization of functions of one variable (Section 2)
Using Microsoft® Excel This presentation is designed for Chapter 1, Section 1.2.
Variations on Backpropagation.
Math 3120 Differential Equations with Boundary Value Problems
Eastern Mediterranean University Department Of Industrial Engineering Deterministic Dynamic Programming presented by: Ziad El Masri Supervisor: Prof. Dr.
ENG241 Digital Design Week #7 Sequential Circuits (Part B)
Optimization in Engineering Design 1 Introduction to Non-Linear Optimization.
Application of the GA-PSO with the Fuzzy controller to the robot soccer Department of Electrical Engineering, Southern Taiwan University, Tainan, R.O.C.
1 Exercise 1. (a) Find all optimal sequences for the scheduling problem 1 ||  w j C j with the following jobs. (b) Determine the effect of a change in.
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Boolean Logic.
Golden Section Method Prepared by Shahrzad Kavianirad Submitted to Prof. Dr. Sahand Daneshvar.
Department of Electrical Engineering, Southern Taiwan University 1 Robotic Interaction Learning Lab The ant colony algorithm In short, domain is defined.
8.1 – Sequences and Series. Sequences Infinite sequence = a function whose domain is the set of positive integers a 1, a 2, …, a n are the terms of the.
Week #7 Sequential Circuits (Part B)
Boundary Element Analysis of Systems Using Interval Methods
دانشگاه شهیدرجایی تهران
Chapter 5 Number Theory 2012 Pearson Education, Inc.
تعهدات مشتری در کنوانسیون بیع بین المللی
EE2174: Digital Logic and Lab
Chapter 5 Number Theory 2012 Pearson Education, Inc.
Applied Combinatorics, 4th Ed. Alan Tucker
DESIGN OF SEQUENTIAL CIRCUITS
Introduction to Probability: Solutions for Quizzes 4 and 5
9 x 14 9 x 12 Calculate the value of the following: 1 8 × 9 =
Bracketing.
Presentation transcript:

Optimization Theory O Professor: Dr. Sahand Daneshvar O Student’s Name: Milad Kermani (125512) M.S student of Mechanical Engineering Department Eastern Mediterranean University, EMU Spring 2013

NONLINEAR PROGRAMMING Golden Section Method Fibonacci Search

Sequential Search Procedure O Dichotomous Search O The Golden Section Method O The Fibonacci Search

Golden Section Method O Aim: Minimizing a strictly quasi-convex * θ function over the interval [a k,b k ].

Initialization Step: O Choose an allowable final length of uncertainty l >0, O [a k,b k ] is the initial interval of uncertainty, O k=1 ( the number of k depends on the points are in the interval). O Calculate:

Cont. O α=0.618 O Evaluate: O Design a table with below components: Kakak bkbk λkλk μkμk θ(λk)θ(λk)θ(μk)θ(μk) …………………

Cont. O According to the value will be obtained for θ(λ k ) & θ(μ k ) have to make decision for next row of table. Follow the processes:

Cont. O Case 1:

Cont. O Case 2:

Example O The length of uncertainty initial interval is 8. (l=8). Reduction this interval of uncertainty is our aim:

Cont. O Evaluate λ 1 and μ 1 and obtain the value of θ for each of these parameters and write down them in the right places of table. Now, the condition of case 2 is happened. Since I want to MINIMIZE the function; thus the θ related to λ 1 is the min one in table.

Cont.

Fibonacci Search O A line search procedure for minimizing a strictly quasi-convex function θ over a closed bounded interval. Fibonacci Sequence {F ν } : F ν+1 =F ν +F ν-1 ν=1,2,… F 0 =F 1 =1 O {F ν }= 1,1,2,3,5,8,13,21,34,55,89,144,233,…

Notice O The most prominent points to remark are the differences in evaluation of λ k and μ k. O The next steps like making a table and other parameters are the same as before. O Just to remind them: L > 0 Allowable final length of uncertainty ε > 0Distinguished constant [a k,b k ]The interval of uncertainty

Initial Steps: O Evaluate: O Evaluation the value of θ for each of λ and μ O Draw a table and follow the previous rules of last table.

Example O The length of uncertainty initial interval is 8. (l=8). Reduction this interval of uncertainty is our aim:

Cont. O n=9 & ε=0.01

Make a table

Thank you for your attention. END