Determining the optimal solution to a real-world engineering problem

Slides:



Advertisements
Similar presentations
Linear Programming: The Filing Cabinet Dilemma: Algebra 2 MathScience Innovation Center Betsey Davis.
Advertisements

Linear Programming Project. Warm-Up Write an Inequality for the following.
456/556 Introduction to Operations Research Chapter 3: Introduction to Linear Programming.
Linear Programming Vocabulary Linear Programming Objective Function Constraints.
© 2003 Anita Lee-Post Linear Programming Part 2 By Anita Lee-Post.
Chapter 19 – Linear Programming
Managerial Decision Making Chapter 4. 2 Managerial Decision Making Decision making is not easy It must be done amid – ever-changing factors – unclear.
Learning Objectives for Section 5.3
Chapter 5 Linear Inequalities and Linear Programming Section 3 Linear Programming in Two Dimensions: A Geometric Approach.
Chapter 8: Linear Programming
Linear Programming. A linear programming problem is made up of an objective function and a system of constraints. The objective function is an algebraic.
19 Linear Programming CHAPTER
(1/24 and 1/27) Bellwork: 1)List 2 things we’ve discussed this semester 2)What is one positive thing you’d be willing to share?
6s-1Linear Programming CHAPTER 6s Linear Programming.
D1: Linear Programming.
Objectives: Set up a Linear Programming Problem Solve a Linear Programming Problem.
Linear Programming Models in Services. Stereo Warehouse Let x = number of receivers to stock y = number of speakers to stock Maximize 50x + 20y gross.
Unit 1 Linear programming. Define: LINEAR PROGRAMMING – is a method for finding a minimum or maximum value of some quantity, given a set of constraints.
Graphing Linear Equations in Two Variables The Graph of a linear equation in two variables is the graph of all the ordered pairs (x,y) that satisfy the.
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
Determine if the given ordered pair is a solution of
Linear programming Lecture (4) and lecture (5). Recall An optimization problem is a decision problem in which we are choosing among several decisions.
Chapter 15 Constrained Optimization. The Linear Programming Model Let : x 1, x 2, x 3, ………, x n = decision variables Z = Objective function or linear.
Roman Keeney AGEC  In many situations, economic equations are not linear  We are usually relying on the fact that a linear equation.
LINEAR PROGRAMMING This opportunity if funded by the United States Department of Education. Award # DAY 7 : 6/26/2012 This opportunity.
Linear Programming. Many problems involve quantities that must be maximized or minimized. Businesses are interested in maximizing profit. An operation.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
Linear Programming An Example. Problem The dairy "Fior di Latte" produces two types of cheese: cheese A and B. The dairy company must decide how many.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
Linear Programming. What is Linear Programming? Say you own a 500 square acre farm. On this farm you can grow wheat, barley, corn or some combination.
Systems of Inequalities in Two Variables Sec. 7.5a.
Linear Programming. Many mathematical models designed to solve problems in business, biology, and economics involve finding the optimum value (maximum.
5. Linear Programming Objectives: 1.Problem formulation 2.Solving an LP problem graphically 3.Bounded regions and corner points Refs: B&Z 5.2.
Linear Programming 1.4 Algebra II.
Monday WARM-UP: TrueFalseStatementCorrected Statement F 1. Constraints are conditions written as a system of equations Constraints are conditions written.
3.4: Linear Programming Objectives: Students will be able to… Use linear inequalities to optimize the value of some quantity To solve linear programming.
December 4, 2015 Hanging with Harvard 4 L INEAR P ROGRAMMING.
Managerial Economics Linear Programming Aalto University School of Science Department of Industrial Engineering and Management January 12 – 28, 2016 Dr.
Warm-upWarm-up Sketch the region bounded by the system of inequalities: 1) 2) Sketch the region bounded by the system of inequalities: 1) 2)
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
Sullivan Algebra and Trigonometry: Section 12.9 Objectives of this Section Set Up a Linear Programming Problem Solve a Linear Programming Problem.
Don Sutton Spring LP Basic Properties Objective Function – maximize/minimize profit/cost Resource Constraints – labor, money Decision.
Math Jeopardy F $100 F $200 E $300 E $400 Abs $500 Abs $100 LF $200 LF $300 LF $400 SP $500 SP $100 LP $200 LP $300 LP $400 LP $500 LP $100 LP $200 LP.
1. What does a need to be if there were infinitely many solutions to the system of equations. y + 2x = 12 2y + 4x = 2a.
6s-1Linear Programming William J. Stevenson Operations Management 8 th edition.
Linear programming Lecture (4) and lecture (5). Recall An optimization problem is a decision problem in which we are choosing among several decisions.
Linear Programming Question 1 A local farmer raises pigs and geese. Two constraints: 1.The farmer wants to raise no more than 16 animals. 2.The farmer.
An Introduction to Linear Programming
GENERAL MATHS – UNIT TWO
Engineering Economics (2+0)
LINEARPROGRAMMING 5/23/ :13 AM 5/23/ :13 AM 1.
Managerial Economics Linear Programming
A seminar talk on “SOLVING LINEAR PROGRAMMING PROBLEM BY GRAPHICAL METHOD” By S K Indrajitsingha M.Sc.
Chapter 5 Linear Inequalities and Linear Programming
Systems of Equations and Inequalities
Lesson 4-3 System of Inequalities
Linear Programming The Graphical Method Review Problems
GENERAL MATHS – UNIT TWO
Constrained Optimization
Linear Optimization The Punch Line.
GENERAL MATHS – UNIT TWO
and Graphing Inequalities
Linear Programming Objectives: Set up a Linear Programming Problem
Objective Vocabulary Solve linear programming problems.
Linear Programming Example: Maximize x + y x and y are called
Systems of Inequalities and Linear Programming
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Optimization (Max/Min)
Case 2:( Model Construction):
Presentation transcript:

Determining the optimal solution to a real-world engineering problem IEEE TEP Activity 3: It’s all about Optimization 2010 Spring Technical English Program Санкт-Петербург, Рассия May 15, 2010 Determining the optimal solution to a real-world engineering problem

IEEE TEP: All About Optimization OPTIMIZE a quantity of interest MINIMIZE MAXIMIZE Time Risk Cost Effort Energy Efficiency Performance Return Revenue Profit

IEEE TEP: All About Optimization Example problem You need to buy some filing cabinets. Two choices Cabinet X and Cabinet Y

IEEE TEP: All About Optimization Example problem Cabinet X Cabinet Y Costs $10 per unit Costs $20 per unit Requires six (6) square feet of floor space Requires eight (8) square feet of floor space Holds eight (8) cubic feet of files Holds twelve (12) cubic feet of files

IEEE TEP: All About Optimization Your role -- is to optimize!!! You have been given $140 for this purchase, though you don't have to spend that much. The office has room for no more than 72 square feet of cabinets. How many of which model should you buy, in order to maximize storage volume?

IEEE TEP: All About Optimization Your approach?

IEEE TEP: All About Optimization Variables of interest?

IEEE TEP: All About Optimization Mathematical Model – Define Variables What are my variables of interest? x: number of model X cabinets purchased y: number of model Y cabinets purchased Also called DECISION VARIABLES.

IEEE TEP: All About Optimization Mathematical Model – Define Variables What are my variables of interest? x: number of model X cabinets purchased y: number of model Y cabinets purchased Also called DECISION VARIABLES. Other quantities of interest based on the information provided?

IEEE TEP: All About Optimization Mathematical Model – Define Variables What are my variables of interest? x: number of model X cabinets purchased y: number of model Y cabinets purchased Also called DECISION VARIABLES. Other quantities of interest based on the information provided: Cost: C = 10x+20y

IEEE TEP: All About Optimization Mathematical Model – Define Variables What are my variables of interest? x: number of model X cabinets purchased y: number of model Y cabinets purchased Also called DECISION VARIABLES. Other quantities of interest based on the information provided: Cost: C = 10x+20y Space: S = 6x + 8y

IEEE TEP: All About Optimization Mathematical Model – Define Variables What are my variables of interest? x: number of model X cabinets purchased y: number of model Y cabinets purchased Also called DECISION VARIABLES. Other quantities of interest based on the information provided: Cost: C = 10x+20y Space: S = 6x + 8y Volume: V = 8x + 12y

IEEE TEP: All About Optimization Any Constraints?

IEEE TEP: All About Optimization Mathematical Model – Any constraints? Are there any constraints on cost (money)?

IEEE TEP: All About Optimization Mathematical Model – Any constraints? Are there any constraints on cost (money)? Yes – I only have $140 to purchase

IEEE TEP: All About Optimization Mathematical Model – Any constraints? Are there any constraints on cost (money)? Yes – I only have $140 to purchase i.e. Cost: C < 140 i.e. 10x + 20y < 140 or y < – ( 1/x) + 7

IEEE TEP: All About Optimization Mathematical Model – Any constraints? Are there any constraints on space?

IEEE TEP: All About Optimization Mathematical Model – Any constraints? Are there any constraints on space? Yes - no more than 72 square feet of cabinets

IEEE TEP: All About Optimization Mathematical Model – Any constraints? Are there any constraints on space? Yes - no more than 72 square feet of cabinets i.e. Space: S < 72 i.e. 6x + 8y < 72 or y < – ( 3/ 4)x + 9

IEEE TEP: All About Optimization All Constraints together

IEEE TEP: All About Optimization All Constraints together Are there any constraints on cost (money)? Yes – I only have $140 to purchase i.e. Cost: C < 140 i.e. 10x + 20y < 140 or y < – ( 1/x) + 7 Are there any constraints on space? Yes - no more than 72 square feet of cabinets i.e. Space: S < 72 i.e. 6x + 8y < 72 or y < – ( 3/ 4)x + 9

IEEE TEP: All About Optimization What about volume?

IEEE TEP: All About Optimization Mathematical Model – Any constraints? Are there any constraints on volume? Not really We are trying to MAXIMIZE VOLUME i.e. MAXIMIZE: Volume: V = 8x + 12y

IEEE TEP: All About Optimization Mathematical Model – FINAL MODEL MAXIMIZE: VOLUME: V = 8x + 12y subject to: COST: y < – ( 1/x) + 7 and SPACE: y < – ( 3/ 4)x + 9

IEEE TEP: All About Optimization Let’s look at the Feasible Region y 10 8 6 x = 0 4 2 x 2 4 8 10 12 6 14 y = 0

IEEE TEP: All About Optimization Let’s look at the Feasible Region y 10 8 SPACE: y < – ( 3/ 4)x + 9 6 x = 0 4 2 x 2 4 8 10 12 6 14 y = 0

IEEE TEP: All About Optimization Let’s look at the Feasible Region y 10 8 6 x = 0 4 COST: y < – ( 1/x) + 7 2 x 2 4 8 10 12 6 14 y = 0

IEEE TEP: All About Optimization Let’s look at the Feasible Region y 10 8 y < – ( 3/ 4)x + 9 6 x = 0 4 2 y < – ( 1/x) + 7 x 2 4 8 10 12 6 14 y = 0

IEEE TEP: All About Optimization Let’s Look at the Feasible Region y 10 8 y < – ( 3/ 4)x + 9 6 x = 0 4 2 y < – ( 1/x) + 7 x 2 4 8 10 12 6 14 y = 0

IEEE TEP: All About Optimization Let’s Look at the Feasible Region y 10 Corner Points 8 y < – ( 3/ 4)x + 9 6 x = 0 4 2 y < – ( 1/x) + 7 x 2 4 8 10 12 6 14 y = 0

IEEE TEP: All About Optimization Finally the solution Solutions are available on the corner of the feasible region

IEEE TEP: All About Optimization Let’s look at the Feasible Region y 10 Corner Points 8 y < – ( 3/ 4)x + 9 6 x = 0 4 2 y < – ( 1/x) + 7 x 2 4 8 10 12 6 14 y = 0

IEEE TEP: All About Optimization Evaluate the volume at corner points V = 8x + 12y At (0, 0) --> V = 0 At (8, 3) --> V = 100 At (0, 7) --> V = 84 At (12, 0) --> V = 84 Optimal solution is (8,3)

IEEE TEP: All About Optimization Your approach Mathematical Model – Write the equations that represent the system/scenario Decision Variables Objective function Constraints 2) Feasible Region – Draw the feasible region on an x-y plane that will show the constraints 3) Solution evaluation – pick points to evaluate the objective function

IEEE TEP: All About Optimization Today’s tasks Form pairs Read the problem provided to you Optimize!