Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.

Slides:



Advertisements
Similar presentations
Optimality conditions for constrained local optima, Lagrange multipliers and their use for sensitivity of optimal solutions.
Advertisements

Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Introduction to Sensitivity Analysis Graphical Sensitivity Analysis
LECTURE 14 Minimization Two Phase method by Dr. Arshad zaheer
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2002 Lecture 8 Tuesday, 11/19/02 Linear Programming.
Computational Methods for Management and Economics Carla Gomes Module 6a Introduction to Simplex (Textbook – Hillier and Lieberman)
Water Resources Development and Management Optimization (Linear Programming) CVEN 5393 Feb 18, 2013.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Optimality conditions for constrained local optima, Lagrange multipliers and their use for sensitivity of optimal solutions Today’s lecture is on optimality.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
The Simplex Method: Standard Maximization Problems
Operation Research Chapter 3 Simplex Method.
Optimization in Engineering Design 1 Lagrange Multipliers.
CES 514 – Data Mining Lecture 8 classification (contd…)
Economics 214 Lecture 37 Constrained Optimization.
Constrained Optimization
Constrained Optimization Economics 214 Lecture 41.
Lecture outline Support vector machines. Support Vector Machines Find a linear hyperplane (decision boundary) that will separate the data.
Lecture 10: Support Vector Machines
D Nagesh Kumar, IIScOptimization Methods: M2L5 1 Optimization using Calculus Kuhn-Tucker Conditions.
5.6 Maximization and Minimization with Mixed Problem Constraints
D Nagesh Kumar, IIScOptimization Methods: M2L3 1 Optimization using Calculus Optimization of Functions of Multiple Variables: Unconstrained Optimization.
Objectives: Set up a Linear Programming Problem Solve a Linear Programming Problem.
Constrained Optimization Rong Jin. Outline  Equality constraints  Inequality constraints  Linear Programming  Quadratic Programming.
MIT and James Orlin © Chapter 3. The simplex algorithm Putting Linear Programs into standard form Introduction to Simplex Algorithm.
Introduction to Optimization (Part 1)
1 Least Cost System Operation: Economic Dispatch 2 Smith College, EGR 325 March 10, 2006.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Linear Programming - Standard Form
1. The Simplex Method.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Optimization of Process Flowsheets S,S&L Chapter 24 T&S Chapter 12 Terry A. Ring CHEN 5253.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
1 Chapter 7 Linear Programming. 2 Linear Programming (LP) Problems Both objective function and constraints are linear. Solutions are highly structured.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
Systems of Inequalities in Two Variables Sec. 7.5a.
Consider minimizing and/or maximizing a function z = f(x,y) subject to a constraint g(x,y) = c. y z x z = f(x,y) Parametrize the curve defined by g(x,y)
CS Statistical Machine learning Lecture 18 Yuan (Alan) Qi Purdue CS Oct
Chapter 4 Linear Programming: The Simplex Method
D Nagesh Kumar, IIScOptimization Methods: M2L4 1 Optimization using Calculus Optimization of Functions of Multiple Variables subject to Equality Constraints.
Kernel Methods: Support Vector Machines Maximum Margin Classifiers and Support Vector Machines.
L8 Optimal Design concepts pt D
Part 4 Nonlinear Programming 4.1 Introduction. Standard Form.
Chapter 4 Sensitivity Analysis, Duality and Interior Point Methods.
(iii) Lagrange Multipliers and Kuhn-tucker Conditions D Nagesh Kumar, IISc Introduction to Optimization Water Resources Systems Planning and Management:
Functions of Several Variables Copyright © Cengage Learning. All rights reserved.
Constraints Feasible region Bounded/ unbound Vertices
Introduction to Optimization
Economics 2301 Lecture 37 Constrained Optimization.
Functions of Several Variables 13 Copyright © Cengage Learning. All rights reserved.
Section Lagrange Multipliers.
Kernel Methods: Support Vector Machines Maximum Margin Classifiers and Support Vector Machines.
Support Vector Machine: An Introduction. (C) by Yu Hen Hu 2 Linear Hyper-plane Classifier For x in the side of o : w T x + b  0; d = +1; For.
3.3 Linear Programming. Vocabulary Constraints: linear inequalities; boundary lines Objective Function: Equation in standard form used to determine the.
Searching a Linear Subspace Lecture VI. Deriving Subspaces There are several ways to derive the nullspace matrix (or kernel matrix). ◦ The methodology.
Business Mathematics MTH-367 Lecture 14. Last Lecture Summary: Finished Sec and Sec.10.3 Alternative Optimal Solutions No Feasible Solution and.
D Nagesh Kumar, IISc Water Resources Systems Planning and Management: M2L2 Introduction to Optimization (ii) Constrained and Unconstrained Optimization.
TU/e Algorithms (2IL15) – Lecture 12 1 Linear Programming.
Tuesday, March 19 The Network Simplex Method for Solving the Minimum Cost Flow Problem Handouts: Lecture Notes Warning: there is a lot to the network.
An Introduction to Linear Programming
Support Vector Machines Introduction to Data Mining, 2nd Edition by
Solving Linear Programming Problems: Asst. Prof. Dr. Nergiz Kasımbeyli
Linear Programming.
13 Functions of Several Variables
Prepared by Po-Chuan on 2016/05/24
Chapter 2. Simplex method
Multivariable optimization with no constraints
Constraints.
L8 Optimal Design concepts pt D
Presentation transcript:

Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery Lecture 4

Optimization of thermal processes2007/2008 Overview of the lecture Method of Lagrange Multipliers −Lagrange function −Necessary condition for a general problem −Sufficient condition −Example: cascade of heat exchangers Multivariable optimization with inequality constraints −Kuhn-Tucker conditions

Optimization of thermal processes2007/2008 Method of Lagrange Multipliers (general problem) Minimize subject to Lagrange function n decision variablesm additional variables (Lagrange multipliers)

Optimization of thermal processes2007/2008 Method of Lagrange Multipliers (necessary condtions for general problem) Necessary condtions We solve these n+m equations for: Possible relative extreme point Lagrange multipliers vector n+m variables

Optimization of thermal processes2007/2008 Method of Lagrange Multipliers (sufficient condtion for general problem – Hancock formulation) where: If each root of the determinantal equation is positive (negative), then X * is minimum (maximum). If some of the roots are positive while the others are negative, the point X * is NOT an extreme point. Polynomial in z

Optimization of thermal processes2007/2008 Method of Lagrange Multipliers EXAMPLE Find the dimensions of a cylindrical tin to maximize its volume such that the total surface area is equal to A 0 =24 . Maximize subject to So the constraint is

Optimization of thermal processes2007/2008 Method of Lagrange Multipliers EXAMPLE contd Necessary condition Possible extreme point

Optimization of thermal processes2007/2008 Method of Lagrange Multipliers EXAMPLE contd So, for A 0 =24  we have Is it an extreme point? Let’s apply sufficiency condition:

Optimization of thermal processes2007/2008 Method of Lagrange Multipliers EXAMPLE contd This equation has one root: Which is negative, so the point corresponds to the maximum of. To calculate the determinant apply Sarrus method Polynomial in z (1 st order)

Optimization of thermal processes2007/2008 Method of Lagrange Multipliers HOMEWORK: Minimize subject to: by: a)direct substitution (see the previous lecture) b)Lagrange multipliers method (make sure you have found a minimum!) Compare the results.

Optimization of thermal processes2007/2008 A design problem: cascade of heat exchangers Choose the heat transfer surfaces (A 1,...,A n ) in the cascade of four heat exchangers to maximize the outlet temperature T 4. The total heat transfer surface is constrained: Assume the same mass flow rates and heat capacity at all stages. Use Lagrange Multipliers method.

Optimization of thermal processes2007/2008 A design problem: cascade of heat exchangers Stage n, heat transfer surface A n n The heat (energy) balance: The kinetics of heat transfer between the flows: k – heat transfer coefficient q – mass flow rate c p – heat capacity After elimination of :

Optimization of thermal processes2007/2008 A design problem: cascade of heat exchangers So, our optimization problem is: maximize subject to constraints: Lagrange function:

Optimization of thermal processes2007/2008 A design problem: cascade of heat exchangers When we employ necessary condition we arrive at: Introducing: Constraints

Optimization of thermal processes2007/2008 A design problem: cascade of heat exchangers variables iteration Maximum outlet temperature

Optimization of thermal processes2007/2008 Multivariable optimization with inequality constraints Minimize subject to Extreme point The region where the constraints are satisfied is called feasible region

Optimization of thermal processes2007/2008 Multivariable optimization with inequality constraints We can transform the inequality constraint to equality constraint with the use of so called slack variables: Minimize subject to where Vector of slack variables Now, we can use method of Lagrange Multipliers...

Optimization of thermal processes2007/2008 Multivariable optimization with inequality constraints We are looking for the stationary points in the way presented earlier: If then

Optimization of thermal processes2007/2008 Multivariable optimization with inequality constraints But means that i.e. the stationary point lies on the boundary of the feasible region. Feasible region Stationary point In this case the constraint is said to be active. Otherwise, the constraint is inactive. Stationary point Inactive constraint

Optimization of thermal processes2007/2008 Multivariable optimization with inequality constraints (Kuhn-Tucker conditions) The slack variables are not needed These conditions are only necessary. They are sufficient for convex programming For minimization

Optimization of thermal processes2007/2008 Thank you for your attention