Optimization Optimization is the methodology for obtaining the best alternative from all possible ones. Unconstrained optimization has only an objective.

Slides:



Advertisements
Similar presentations
PowerPoint Slides by Robert F. BrookerCopyright (c) 2001 by Harcourt, Inc. All rights reserved. Linear Programming Mathematical Technique for Solving Constrained.
Advertisements

Laminated plates.
This section will focus on linear functions and their applications
Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:
Chapter 19 – Linear Programming
Lesson 08 Linear Programming
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Linear Programming Problem
Introduction to multi-objective optimization We often have more than one objective This means that design points are no longer arranged in strict hierarchy.
Optimization. f(x) = 0 g i (x) = 0 h i (x)
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Linear Programming Using the Excel Solver
by Rianto Adhy Sasongko Supervisor: Dr.J.C.Allwright
19 Linear Programming CHAPTER
Compound Inequalities A compound Inequality is when you have your variable is compared to two different values. There are two ways that you will see compound.
The Simplex Method: Standard Maximization Problems
Optimization in Engineering Design 1 Lagrange Multipliers.
Economics 214 Lecture 37 Constrained Optimization.
Lecture 35 Constrained Optimization
1 2TN – Linear Programming  Linear Programming. 2 Linear Programming Discussion  Requirements of a Linear Programming Problem  Formulate:  Determine:Graphical.
6s-1Linear Programming CHAPTER 6s Linear Programming.
5.6 Maximization and Minimization with Mixed Problem Constraints
Linear Programming Old name for linear optimization –Linear objective functions and constraints Optimum always at boundary of feasible domain First solution.
Linear programming. Linear programming… …is a quantitative management tool to obtain optimal solutions to problems that involve restrictions and limitations.
Optimization formulation Optimization methods help us find solutions to problems where we seek to find the best of something. This lecture is about how.
LINEAR PROGRAMMING SIMPLEX METHOD.

Chapter 19 Linear Programming McGraw-Hill/Irwin
Linear Programming Chapter 13 Supplement.
Optimization formulation Optimization methods help us find solutions to problems where we seek to find the best of something. This lecture is about how.
Chapter 6 Linear Programming: The Simplex Method
An Introduction to Programming and Algorithms. Course Objectives A basic understanding of engineering problem solving process. A basic understanding of.
Nonlinear Programming (NLP) Operation Research December 29, 2014 RS and GISc, IST, Karachi.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 15.
ECE 556 Linear Programming Ting-Yuan Wang Electrical and Computer Engineering University of Wisconsin-Madison March
Topic III The Simplex Method Setting up the Method Tabular Form Chapter(s): 4.
Duality Theory  Every LP problem (called the ‘Primal’) has associated with another problem called the ‘Dual’.  The ‘Dual’ problem is an LP defined directly.
Introduction to multi-objective optimization We often have more than one objective This means that design points are no longer arranged in strict hierarchy.
Solving Linear Programming Problems: The Simplex Method
Derivatives In modern structural analysis we calculate response using fairly complex equations. We often need to solve many thousands of simultaneous equations.
LINEAR PROGRAMMING. 2 Introduction  A linear programming problem may be defined as the problem of maximizing or minimizing a linear function subject.
Chapter 4 Linear Programming: The Simplex Method
Chapter 6 Linear Programming: The Simplex Method Section 4 Maximization and Minimization with Problem Constraints.
EML 4230 Introduction to Composite Materials
Optimization formulation Optimization methods help us find solutions to problem where we seek to find the best of something. This lecture is about how.
Goal: Solve and write absolute value equations in one variable Section 4-4: Solving Absolute Value Equations.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Polynomial inequalities Objective –To Solve polynomial inequalities.
Notes Over 4.8 Identifying Functions A relation where each input has exactly one output. Function Decide whether the relation is a function. If it is.
Log Truck Scheduling Problem
1. 2 We studying these special cases to: 1- Present a theoretical explanation of these situations. 2- Provide a practical interpretation of what these.
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
1 Introduction Optimization: Produce best quality of life with the available resources Engineering design optimization: Find the best system that satisfies.
Flexural stiffness design by integer linear programming.
Searching a Linear Subspace Lecture VI. Deriving Subspaces There are several ways to derive the nullspace matrix (or kernel matrix). ◦ The methodology.
Micro Economics in a Global Economy
design and optimization of a composite drive shaft for an automobile
Managerial Economics in a Global Economy
Sensitivity.
Graphical design for specified laminate strain limits
Warm Up Solve for x:
2.1 Solving Linear Inequalities
2.1 – 2.2 Solving Linear Inequalities
Linear Programming Example: Maximize x + y x and y are called
EEE 244-8: Optimization.
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
Laminates of Orthotropic plies
EML 4230 Introduction to Composite Materials
Optimization formulation
Presentation transcript:

Optimization Optimization is the methodology for obtaining the best alternative from all possible ones. Unconstrained optimization has only an objective function. – What is the route and travel speed that minimize the distance, or travel time, or number of turns from UF to your home? Design variables are road segments and speeds. In constrained optimization we add constraints. – No more than 3 stop lights on the way (inequality). – Drive exactly at speed limit (equality constraint).

Standard formulation The standard formulation of an optimization problem is: Minimize: What do we do for maximization? Inequalities have less than zero. What do we do when we have the opposite sense?

Example (but differently)

Formulation Normalize and standardize constraints Optimization problem Need analysis to calculate constraints in terms of design variable (often comes from a computer code rather than an equation).

Analysis

Getting acquainted via Matlab Em=3.45; Ef=124;r=Em/Ef; Vf=linspace(0,0.4,101); E1oEf=Vf+r*(1-Vf); E1oE2=Vf.^2+Vf.*(1-Vf).*(1/r+r)+(1-Vf).^2; E2oE1=1./E1oE2; plot(Vf,E1oEf,Vf,E2oE1,'r-') xlabel('Vf'); legend('E1/Ef','E2/E1','Location','North')

Solution Narrow range and plot constraints Feasible domain when both are negative Vf=linspace(0.1,0.3,101); E1oEf=Vf+r*(1-Vf); E1oE2=Vf.^2+Vf.*(1-Vf).*(1/r+r)+(1-Vf).^2; E2oE1=1./E1oE2; g1=0.2-E1oEf;g2=0.15-E2oE1; plot(Vf,g1,Vf,g2,'r-') xlabel('Vf'); ylabel('g1,g2') legend('g1','g2','Location','North') Solution is Textbook says 0.18 (one student found that the denominator should be 1-r not 1+r, giving

Stacking sequence optimization Most of this course is concerned with optimization of the angles of the fiber in a laminate composed of unidirectional plies. The objective function is either the thickness (total number of plies) or the load that can be carried by a laminate of given thickness. Constraints will be on strains, stresses, buckling loads and natural frequencies.