Min-max Robust Model Predictive Control

Slides:



Advertisements
Similar presentations
3.4 Linear Programming 10/31/2008. Optimization: finding the solution that is either a minimum or maximum.
Advertisements

Is the shape below a function? Explain. Find the domain and range.
A Randomized Polynomial- Time Simplex Algorithm for Linear Programming CS3150 Course Presentation.
1 LP Duality Lecture 13: Feb Min-Max Theorems In bipartite graph, Maximum matching = Minimum Vertex Cover In every graph, Maximum Flow = Minimum.
IEOR 4004 Midterm review (Part II) March 12, 2014.
1 Chapter 11 Here we see cases where the basic LP model can not be used.
Linear Programming – Simplex Method
Use MATLAB to solve linear programs LI Xiao-lei. MATLAB format for linear programs MATLAB uses the following format for linear programs: min z = f T x.
Techniques for Dealing with Hard Problems Backtrack: –Systematically enumerates all potential solutions by continually trying to extend a partial solution.
1/03/09 De 89 à 98. 1/03/09 De 89 à 98 1/03/09 De 89 à 98.
LINEAR PROGRAMMINGExample 1 MaximiseI = x + 0.8y subject tox + y  x + y  x + 2y  2400 Initial solution: I = 0 at (0, 0)
Linear Programming Unit 2, Lesson 4 10/13.
Duality Dual problem Duality Theorem Complementary Slackness
Adversarial Search and Game Playing Examples. Game Tree MAX’s play  MIN’s play  Terminal state (win for MAX)  Here, symmetries have been used to reduce.
Branch and Bound Algorithm for Solving Integer Linear Programming
A CD E B B  2 C  4 C  D + 1 D  6 D  B + 3 D  E + 1 E  B + 1 maximize B+C+D+E B = 2 C = 4 D = 4 E = 3 max: 13 B  0 C  0 D  0 E 
Optimization Discussion Group Comments. What Is Optimization? Max y or min y f(z) subject to: g(z) ≤0 Examples of objective function: 1) Min deaths due.
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
computer
3.4 Linear Programming p Optimization - Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
Linear Programming Chapter 6. Large Scale Optimization.
CPU Scheduling Gursharan Singh Tatla 1-Feb-20111www.eazynotes.com.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 11-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 11.
Professor: Chu, Ta Chung Student: Nguyen Quang Tung Student’s ID: M977Z235 Fuzzy multiobjective linear model for supplier selection in a supply chain.
1 Max 8X 1 + 5X 2 (Weekly profit) subject to 2X 1 + 1X 2  1000 (Plastic) 3X 1 + 4X 2  2400 (Production Time) X 1 + X 2  700 (Total production) X 1.
Optimization unconstrained and constrained Calculus part II.
3.4: Linear Programming Objectives: Students will be able to… Use linear inequalities to optimize the value of some quantity To solve linear programming.
Integer LP In-class Prob
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
Integer Programming, Branch & Bound Method
Calculus III Hughes-Hallett Chapter 15 Optimization.
Section 15.3 Constrained Optimization: Lagrange Multipliers.
3-5: Linear Programming. Learning Target I can solve linear programing problem.
Algebra II.  To remember everything in 1 st Semetser!
1 Simplex algorithm. 2 The Aim of Linear Programming A Linear Programming model seeks to maximize or minimize a linear function, subject to a set of linear.
Section 3.5 Linear Programing In Two Variables. Optimization Example Soup Cans (Packaging) Maximize: Volume Minimize: Material Sales Profit Cost When.
基 督 再 來 (一). 經文: 1 你們心裡不要憂愁;你們信神,也當信我。 2 在我父的家裡有許多住處;若是沒有,我就早 已告訴你們了。我去原是為你們預備地去 。 3 我 若去為你們預備了地方,就必再來接你們到我那 裡去,我在 那裡,叫你們也在那裡, ] ( 約 14 : 1-3)
3.4 Linear Programming p Optimization - Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
EE4271 VLSI Design VLSI Channel Routing.
。 33 投资环境 3 开阔视野 提升竞争力 。 3 嘉峪关市概况 。 3 。 3 嘉峪关是一座新兴的工业旅游城市,因关得名,因企设市,是长城文化与丝路文化交 汇点,是全国唯一一座以长城关隘命名的城市。嘉峪关关城位于祁连山、黑山之间。 1965 年建市,下辖雄关区、镜铁区、长城区, 全市总面积 2935.
$200 $400 $600 $800 $1000 $200 $400 $600 $800 $1000 $200 $400 $600 $800 $1000 $200 $400 $600 $800 $1000 $200 $400 $600 $800 $1000 $200.
deterministic operations research
Amir Ali Ahmadi (Princeton University)
The Ellipsoid Method Ellipsoid º squashed sphere
FlowMap Algorithm Perform clustering on the following 2-bounded network Intra-cluster and node delay = 0, inter-cluster = 1 Pin constraint = 3 Practical.
In the name of God.
Chap 9. General LP problems: Duality and Infeasibility
3.2 Linear Programming 3 Credits AS
Linear Programming.
Grade 6 Geometry and Measures Upper and Lower Bounds 2.
The infinite horizon MPC with input targets and control zones
Слайд-дәріс Қарағанды мемлекеттік техникалық университеті
.. -"""--..J '. / /I/I =---=-- -, _ --, _ = :;:.
Operational Research (OR)
8.4 Linear Programming p
Compute convex lower bounding function and optimize it instead!
II //II // \ Others Q.
I1I1 a 1·1,.,.,,I.,,I · I 1··n I J,-·
7.5 – Constrained Optimization: The Method of Lagrange Multipliers
Bruno D. O. Caprona and Darci Odloakb
LINEAR PROGRAMMING Example 1 Maximise I = x + 0.8y
Adversarial Search and Game Playing Examples
1.6 Linear Programming Pg. 30.
“Rate-Optimal” Resource-Constrained Software Pipelining
MinMax Principle in Game Theory – continued….
. '. '. I;.,, - - "!' - -·-·,Ii '.....,,......, -,
Do Now Exercise Solve each linear system
Simplex Tableau Method
Integer Programming (IP)
Vibration Gen NDE Bearing
Presentation transcript:

Min-max Robust Model Predictive Control D.Odloak PQI5781- Controle de Processos Químicos II (AIChE Journal, 2004, 50 (8), 1824-1836)

Process Model – OPOM (Stable systems) , , , where

Extended IHMPC Objective Function (OF) Bounded OF Bounding constraint (end constraint)

Extended IHMPC Objective Function where

Extended IHMPC Optimization Problem

Min-Max Robust IHMPC We define

Min-Max Robust IHMPC Objective Function where H, cf and c are computed with and the terminal cost is computed with

Min-Max Robust IHMPC Optimization Problem (25) , Min-Max Robust IHMPC Optimization Problem Problem P4 Subject to (25)

Example: Debutanizer column

Example: Debutanizer column

Example: Debutanizer column