Optimization formulation Optimization methods help us find solutions to problems where we seek to find the best of something. This lecture is about how.

Slides:



Advertisements
Similar presentations
February 14, 2002 Putting Linear Programs into standard form
Advertisements

OAA Math Terms. y-axis the vertical number line in a coordinate plane.
Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:
Solving LP Models Improving Search Special Form of Improving Search
Lesson 08 Linear Programming
Linear Programming Problem
To optimize something means to maximize or minimize some aspect of it… Strategy for Solving Max-Min Problems 1. Understand the Problem. Read the problem.
1 Chapter 4 Experiments with Blocking Factors The Randomized Complete Block Design Nuisance factor: a design factor that probably has an effect.
Chapter 4 Randomized Blocks, Latin Squares, and Related Designs
Introduction to Management Science
Introduction to Management Science
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
OPTIMAL CONTROL SYSTEMS
3D Geometry for Computer Graphics. 2 The plan today Least squares approach  General / Polynomial fitting  Linear systems of equations  Local polynomial.
1 Introduction to Linear and Integer Programming Lecture 9: Feb 14.
1 2TN – Linear Programming  Linear Programming. 2 Linear Programming Discussion  Requirements of a Linear Programming Problem  Formulate:  Determine:Graphical.
1 MF-852 Financial Econometrics Lecture 2 Matrix Operations in Econometrics, Optimization with Excel Roy J. Epstein Fall 2003.
6s-1Linear Programming CHAPTER 6s Linear Programming.
Lecture outline Support vector machines. Support Vector Machines Find a linear hyperplane (decision boundary) that will separate the data.
Introduction to Management Science
Lecture 10: Support Vector Machines
Game Theory.
MIT and James Orlin © Chapter 3. The simplex algorithm Putting Linear Programs into standard form Introduction to Simplex Algorithm.
Linear Programming Old name for linear optimization –Linear objective functions and constraints Optimum always at boundary of feasible domain First solution.
Non-Linear Simultaneous Equations
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.
6.1 Solving Linear Inequalities in One Variable
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
9-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Multicriteria Decision Making Chapter 9.
Multicriteria Decision Making
9-1 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Multicriteria Decision Making Chapter 9.
Operations Management
Nonlinear Programming (NLP) Operation Research December 29, 2014 RS and GISc, IST, Karachi.
Nonlinear Programming
Ken YoussefiMechanical Engineering Dept. 1 Design Optimization Optimization is a component of design process The design of systems can be formulated as.
Chapter 9 - Multicriteria Decision Making 1 Chapter 9 Multicriteria Decision Making Introduction to Management Science 8th Edition by Bernard W. Taylor.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Functions of Several Variables Copyright © Cengage Learning. All rights reserved.
Design of Algorithms using Brute Force Approach. Primality Testing (given number is n binary digits)
Notes 5IE 3121 Knapsack Model Intuitive idea: what is the most valuable collection of items that can be fit into a backpack?
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Chapter 1. Formulations 1. Integer Programming  Mixed Integer Optimization Problem (or (Linear) Mixed Integer Program, MIP) min c’x + d’y Ax +
The Formulate2 Dairy Ration Optimizer Power + Simplicity = Productivity.
LINEAR PROGRAMMING. 2 Introduction  A linear programming problem may be defined as the problem of maximizing or minimizing a linear function subject.
2005MEE Software Engineering Lecture 11 – Optimisation Techniques.
1 1 Slide © 2005 Thomson/South-Western Linear Programming: The Simplex Method n An Overview of the Simplex Method n Standard Form n Tableau Form n Setting.
CSE 589 Part VI. Reading Skiena, Sections 5.5 and 6.8 CLR, chapter 37.
Optimization formulation Optimization methods help us find solutions to problem where we seek to find the best of something. This lecture is about how.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
Optimization Optimization is the methodology for obtaining the best alternative from all possible ones. Unconstrained optimization has only an objective.
3 Components for a Spreadsheet Optimization Problem  There is one cell which can be identified as the Target or Set Cell, the single objective of the.
8/14/04 J. Bard and J. W. Barnes Operations Research Models and Methods Copyright All rights reserved Lecture 6 – Integer Programming Models Topics.
Optimization in Engineering Design 1 Introduction to Non-Linear Optimization.
Lecture 6 – Integer Programming Models Topics General model Logic constraint Defining decision variables Continuous vs. integral solution Applications:
Optimization formulation Optimization methods help us find solutions to problems where we seek to find the best of something. This lecture is about how.
DECISION 1. How do you do a Bubble Sort? Bubble Sort:  You compare adjacent items in a list;  If they are in order, leave them.  If they are not in.
Exhaustive search Exhaustive search is simply a brute- force approach to combinatorial problems. It suggests generating each and every element of the problem.
Chapter 2 An Introduction to Linear Programming
Optimizing Area/SA/Volume
Linear Programming Dr. T. T. Kachwala.
LECTURE 03: DECISION SURFACES
Dr. Arslan Ornek IMPROVING SEARCH
Chapter 4 Linear Programming: The Simplex Method
13 Functions of Several Variables
Math Statistics/Geometry Mean Median, Mode Area & Perimeter Formulas
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
Algorithms CSCI 235, Spring 2019 Lecture 30 More Greedy Algorithms
Chapter 1. Formulations.
Optimization formulation
Presentation transcript:

Optimization formulation Optimization methods help us find solutions to problems where we seek to find the best of something. This lecture is about how we formulate the problem mathematically. In this lecture we make the assumption that we have choices and that we can attach numerical values to the ‘goodness’ of each alternative. This is not always the case. We may have problems where the only thing we can do is compare pairs of alternatives and tell which one is better, but not by how much. Can you think of an example?

Young Modulus Example

Unconstrained formulations

Knapsack problem You have five items that you can put in your knapsack as gifts to friends. However their combined weight is more than the 20 pounds that you are willing to carry. Formulate the problem of choosing a subset of maximum total value. Use binary design variables Objective is total value minus $10 if weight exceeds 20 lb, plus $10 otherwise Item12345 Weight (lb) Value ($)12 275

Problems Formulate an unconstrained optimization problem for each of the following situations, identifying the design variables and objective function. 1.Find the aspect ratio of a rectangle with the highest ratio of area to square of the perimeter. Solution.Solution. 2.You need to fly to a city in Florida, rent a car, and visit Gainesville, Jacksonville and Tampa and fly back from the last city you visit. What should your itinerary be to minimize your driving distance? SolutionSolution 3.You need to perform a task once a month, on the same day of each month (e.g., the 13 th ). It is more inconvenient to do on a weekend. Select the day of the month to minimize the number of times it will fall on a weekend in one given year (not a leap year). Solution.Solution.

Constrained formulation To avoid a non-smooth function, we can add a bound design variable b, as well as error bounds The objective function is equal to one design, b, variable. E appears only in the constraints. Not only is the new objective and constraints smooth, but they are also linear. Here we know the sign of the differences so we can replace with

Graphical optimization Recall the linear constrained optimization formulation. With only two design variables we can plot it. Optimum at constraint boundary intersection.

Standard notation The standard form of an optimization problem used by most textbooks and software is Standard form of Young’s modulus fit

Column design example Height is fixed, design variables are D and t. Objective function is cross-sectional area. Three failure modes

Failure modes

Standard dimensionless formulation Normalized constraints are better both numerically and for communicating degree of satisfaction.

Problems Provide two formulations in standard form for minimizing the surface area of a cylinder of a given volume when the diameter and height are the design variables. One formulation should use the volume as equality constraint, and another use it to reduce the number of design variables. Solution. Solution. Formulate in standard normal form the problem of finding an open-top rectangle with an area of at least 50 and minimum perimeter. Solution.Solution You need to go from point A to point B in minimum time while maintaining a safe distance from point C. Formulate an optimization problem in standard normalized form to find the path with no more than three design variables when A=(0,0), B=(10,10), C=(4,4), and the minimum safe distance is 5. SolutionSolution