Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning. 8-1 Nonlinear Programming & Evolutionary Optimization.

Slides:



Advertisements
Similar presentations
Linear Programming Problem
Advertisements

10-1 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Nonlinear Programming Chapter 10.
MS&E 211 Quadratic Programming Ashish Goel. A simple quadratic program Minimize (x 1 ) 2 Subject to: -x 1 + x 2 ≥ 3 -x 1 – x 2 ≥ -2.
B-1 Operations Management Linear Programming Module B - New Formulations.
Introduction to Mathematical Programming OR/MA 504 Chapter 6 Goal programming and Multiple Objective Optimization.
BA 555 Practical Business Analysis
Introduction to Management Science
Lecture 8 – Nonlinear Programming Models Topics General formulations Local vs. global solutions Solution characteristics Convexity and convex programming.
Thursday, April 25 Nonlinear Programming Theory Separable programming Handouts: Lecture Notes.
DECISION MODELING WITH MICROSOFT EXCEL Copyright 2001 Prentice Hall Publishers and Ardith E. Baker Nonlinear Chapter 7 Optimization Part 2.
1 Spreadsheet Modeling & Decision Analysis: A Practical Introduction to Management Science 3d edition by Cliff Ragsdale.
Non Linear Programming 1
LECTURE 5 : PORTFOLIO THEORY
MIT and James Orlin © Nonlinear Programming Theory.
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 6 th edition Cliff T. Ragsdale © 2011 Cengage Learning. All Rights.
Session 4b. Decision Models -- Prof. Juran2 Overview More Network Flow Models Facility Location Example Locating Call Centers Nonlinearity.
Math443/543 Mathematical Modeling and Optimization
Chapter 13 Queuing Theory
ENGR 351 Numerical Methods Instructor: Dr. L.R. Chevalier
Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning. 8-1 Introduction to Nonlinear Programming (NLP)
B-1 Operations Management Linear Programming Module B - Harder Formulations.
Objectives: Set up a Linear Programming Problem Solve a Linear Programming Problem.
Spreadsheet Modeling & Decision Analysis:
Spreadsheet Modeling & Decision Analysis:
Optimization of Linear Problems: Linear Programming (LP) © 2011 Daniel Kirschen and University of Washington 1.
Optimization I Operations -- Prof. Juran. Outline Basic Optimization: Linear programming –Graphical method –Spreadsheet Method Extension: Nonlinear programming.
Linear Programming Models: Graphical and Computer Methods
1-1 Introduction to Optimization and Linear Programming Chapter 1.
Linear programming Lecture (4) and lecture (5). Recall An optimization problem is a decision problem in which we are choosing among several decisions.
Solver & Optimization Problems n An optimization problem is a problem in which we wish to determine the best values for decision variables that will maximize.
Spreadsheet Modeling & Decision Analysis
Roman Keeney AGEC  In many situations, economic equations are not linear  We are usually relying on the fact that a linear equation.
Introduction to Mathematical Programming
Special Conditions in LP Models (sambungan BAB 1)
Chapter 11 Nonlinear Programming
Spreadsheet Modeling & Decision Analysis:
Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning. 8-1 Nonlinear Programming & Evolutionary Optimization.
Some Key Facts About Optimal Solutions (Section 14.1) 14.2–14.16
Nonlinear Programming (NLP) Operation Research December 29, 2014 RS and GISc, IST, Karachi.
Business Analytics with Nonlinear Programming
Spreadsheet Modeling & Decision Analysis:
Chapter 3 Delineating Efficient Portfolios Jordan Eimer Danielle Ko Raegen Richard Jon Greenwald.
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.
Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning. 6-1 Integer Linear Programming Chapter 6.
 A concert promoter wants to book a rock group for a stadium concert. A ticket for admission to the stadium playing field will cost $125, and a ticket.
1 Spreadsheet Modeling & Decision Analysis: A Practical Introduction to Management Science, 3e by Cliff Ragsdale.
Spreadsheet Modeling & Decision Analysis
LINEAR PROGRAMMING APPLICATIONS IN MARKETING, FINANCE, AND OPERATIONS MANAGEMENT (2/3) Chapter 4 MANGT 521 (B): Quantitative Management.
Nonlinear Programming Models
Risk Analysis & Modelling
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.
1 Multi-Objective Portfolio Optimization Jeremy Eckhause AMSC 698S Professor S. Gabriel 6 December 2004.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Table of Contents CD Chapter 14 (Solution Concepts for Linear Programming) Some Key Facts.
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.
IT Applications for Decision Making. Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the.
Chapter 7 Nonlinear Optimization Models. Introduction The objective and/or the constraints are nonlinear functions of the decision variables. Select GRG.
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.
Sullivan Algebra and Trigonometry: Section 12.9 Objectives of this Section Set Up a Linear Programming Problem Solve a Linear Programming Problem.
EMGT 5412 Operations Management Science Nonlinear Programming: Introduction Dincer Konur Engineering Management and Systems Engineering 1.
Class Business Debate #2 Upcoming Groupwork – Spreadsheet Spreadsheet.
1. What does a need to be if there were infinitely many solutions to the system of equations. y + 2x = 12 2y + 4x = 2a.
Chapter 9 Integer Programming to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole,
Linear programming Lecture (4) and lecture (5). Recall An optimization problem is a decision problem in which we are choosing among several decisions.
Optimization Modeling: Applications Integer Programming Chapter 15.
Spreadsheet Modeling & Decision Analysis:
Linear Programming Objectives: Set up a Linear Programming Problem
Spreadsheet Modeling & Decision Analysis
Spreadsheet Modeling & Decision Analysis:
Spreadsheet Modeling & Decision Analysis:
Presentation transcript:

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning. 8-1 Nonlinear Programming & Evolutionary Optimization Chapter 8

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning. 8-2 Introduction to Nonlinear Programming (NLP) u An NLP problem has a nonlinear objective function and/or one or more nonlinear constraints. u NLP problems are formulated and implemented in virtually the same way as linear problems. u The mathematics involved in solving NLPs is quite different than for LPs. u Solver tends to mask this difference but it is important to understand the difficulties that may be encountered when solving NLPs.

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning. 8-3 Possible Optimal Solutions to NLPs (not occurring at corner points) objective function level curve optimal solution Feasible Region linear objective, nonlinear constraints objective function level curve optimal solution Feasible Region nonlinear objective, nonlinear constraints objective function level curve optimal solution Feasible Region nonlinear objective, linear constraints objective function level curves optimal solution Feasible Region nonlinear objective, linear constraints

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning. 8-4 Local vs. Global Optimal Solutions A C B Local optimal solution Feasible Region D E F G Local and global optimal solution X1X1 X2X2

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning. 8-5 Comments About NLP Algorithms u It is not always best to move in the direction producing the fastest rate of improvement in the objective. u NLP algorithms can terminate a local optimal solutions. u The starting point influences the local optimal solution obtained.

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning. 8-6 Comments About Starting Points u The null starting point should be avoided. u When possible, it is best to use starting values of approximately the same magnitude as the expected optimal values.

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning. 8-7 Location Problems u Many decision problems involve determining optimal locations for facilities or service centers. For example, –Manufacturing plants –Warehouse –Fire stations –Ambulance centers u These problems usually involve distance measures in the objective and/or constraints.  The straight line (Euclidean) distance between two points ( X 1, Y 1 ) and (X 2, Y 2 ) is:

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning. 8-8 A Location Problem: Rappaport Communications u Rappaport Communications provides cellular phone service in several mid-western states. u The want to expand to provide inter-city service between four cities in northern Ohio. u A new communications tower must be built to handle these inter-city calls. u The tower will have a 40 mile transmission radius.

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning. 8-9 Graph of the Tower Location Problem Cleveland Akron Youngstown Canton x=5, y=45 x=12, y=21 x=17, y=5 x=52, y= X Y 0 10

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning Defining the Decision Variables X 1 = location of the new tower with respect to the X-axis Y 1 = location of the new tower with respect to the Y-axis

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning Defining the Objective Function u Minimize the total distance from the new tower to the existing towers MIN:

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning Defining the Constraints u Cleveland u Akron u Canton u Youngstown

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning Implementing the Model See file Fig8-10.xls

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning Analyzing the Solution u The optimal location of the “new tower” is in virtually the same location as the existing Akron tower. u Maybe they should just upgrade the Akron tower. u The maximum distance is 39.8 miles to Youngstown. u This is pressing the 40 mile transmission radius. u Where should we locate the new tower if we want the maximum distance to the existing towers to be minimized?

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning Implementing the Model See file Fig8-13.xls

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning Comments on Location Problems u The optimal solution to a location problem may not work: –The land may not be for sale. –The land may not be zoned properly. –The “land” may be a lake. u In such cases, the optimal solution is a good starting point in the search for suitable property. u Constraints may be added to location problems to eliminate infeasible areas from consideration.

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning Optimizing Existing Financial Models u It is not necessary to always write out the algebraic formulation of an optimization problem, although doing so ensures a thorough understanding of the problem. u Solver can be used to optimize a host of pre- existing spreadsheet models which are inherently nonlinear.

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning A Life Insurance Funding Problem u Thom Pearman owns a whole life policy with surrender value of $6,000 and death benefit of $40,000. u He’d like to cash in his whole life policy and use interest on the surrender value to pay premiums on a a term life policy with a death benefit of $350,000. Year Premium$423 $457 $489 $516 $530 $558 $595 $618 $660 $716 u The premiums on the new policy for the next 10 years are: u Thom’s marginal tax rate is 28%. u What rate of return will be required on his $6,000 investment?

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning Implementing the Model See file Fig8-22.xls

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning The Portfolio Optimization Problem u A financial planner wants to create the least risky portfolio with at least a 12% expected return using the following stocks. Annual Return YearIBCNMCNBS 111.2%8.0%10.9% 210.8%9.2%22.0% 311.6%6.6%37.9% 4-1.6%18.5%-11.8% 5-4.1%7.4%12.9% 68.6%13.0%-7.5% 76.8%22.0%9.3% 811.9%14.0%48.7% 912.0%20.5%-1.9% 108.3%14.0%19.1% 116.0%19.0%-3.4% %9.0%43.0% Avg7.64%13.43%14.93% Covariance Matrix IBCNMCNBS IBC NMC NBS

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning Defining the Decision Variables p 1 = proportion of funds invested in IBC p 2 = proportion of funds invested in NMC p 3 = proportion of funds invested in NBS

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning Defining the Objective Minimize the portfolio variance (risk).

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning Defining the Constraints u Expected return p p p 3 >= 0.12 u Proportions p 1 + p 2 + p 3 = 1 p 1, p 2, p 3 >= 0 p 1, p 2, p 3 <= 1

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning Implementing the Model See file Fig8-26.xls

Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning The Efficient Frontier %10.50%11.00%11.50%12.00%12.50%13.00%13.50%14.00%14.50%15.00% Portfolio Return Portfolio Variance Efficient Frontier