Chapter 7 Nonlinear Optimization Models. Introduction The objective and/or the constraints are nonlinear functions of the decision variables. Select GRG.

Slides:



Advertisements
Similar presentations
Chapter 19 – Linear Programming
Advertisements

Nonlinear Programming McCarl and Spreen Chapter 12.
10-1 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Nonlinear Programming Chapter 10.
Analyzing Multivariable Change: Optimization
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.
BA 452 Lesson A.2 Solving Linear Programs 1 1ReadingsReadings Chapter 2 An Introduction to Linear Programming.
Introduction to Management Science
Lecture 8 – Nonlinear Programming Models Topics General formulations Local vs. global solutions Solution characteristics Convexity and convex programming.
Chapter 7 Nonlinear Optimization Models. Thomson/South-Western 2007 © South-Western/Cengage Learning © 2012 Practical Management Science, 4e Winston/Albright.
1 BIS APPLICATION MANAGEMENT INFORMATION SYSTEM Planning modeling Chapter outline: 1.The basic planning problem 2.The basic pricing problem 3.Nonlinear.
MIT and James Orlin © Nonlinear Programming Theory.
Session 4b. Decision Models -- Prof. Juran2 Overview More Network Flow Models Facility Location Example Locating Call Centers Nonlinearity.
10 Output and Costs Notes and teaching tips: 4, 7, 23, 27, 31, and 54.
Economics 214 Lecture 7 Introduction to Functions Cont.
Chapter 10: Iterative Improvement
Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning. 8-1 Introduction to Nonlinear Programming (NLP)
1 5. Linear Programming 1.Introduction to Constrained Optimization –Three elements: objective, constraints, decisions –General formulation –Terminology.
1 MF-852 Financial Econometrics Lecture 2 Matrix Operations in Econometrics, Optimization with Excel Roy J. Epstein Fall 2003.
1 Linear Programming Using the software that comes with the book.
Firm Supply Demand Curve Facing Competitive Firm Supply Decision of a Competitive Firm Producer’s Surplus and Profits Long-Run.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
10 OUTPUT AND COSTS CHAPTER.
Economics 214 Lecture 4. Special Property Composite Function.
Chapter 5 - Introduction to Supply Supply is the amount of a product that would be offered for sale at all possible prices in the market. The Law of Supply.
Summer Semester  Objective of a firm in a competitive market is to maximize profit.  Profit is equal to total revenue minus total cost of production.
Non-Linear Simultaneous Equations
Introduction to Optimization (Part 1)
Economics 101 – Section 5 Lecture #16 – March 11, 2004 Chapter 7 How firms make decisions - profit maximization.
Chapter 3 Introduction to Optimization Modeling
EXAMPLE: 3.1 ASSEMBLING AND TESTING COMPUTERS
Chapter 2 Nonlinear Models Sections 2.1, 2.2, and 2.3.
Managerial Economics Managerial Economics = economic theory + mathematical eco + statistical analysis.
Introduction to Linear Regression and Correlation Analysis
Chapter 4 Consumer and Firm Behavior: The Work- Leisure Decision and Profit Maximization Copyright © 2014 Pearson Education, Inc.
Supply Chapter 5.
Chapter Five Supply  Section One What is Supply?  Section Two The Theory of Production  Section Three Cost, Revenue, and Profit Maximization.
ECON 6012 Cost Benefit Analysis Memorial University of Newfoundland
Roman Keeney AGEC  In many situations, economic equations are not linear  We are usually relying on the fact that a linear equation.
Operations 343 Spreadsheet Modeling Week 15 Quiz Review Homework Review Course Review Lab session.
The Supply Curve and the Behavior of Firms
Nonlinear Programming (NLP) Operation Research December 29, 2014 RS and GISc, IST, Karachi.
Business Analytics with Nonlinear Programming
Linear Programming. Consider the following problem: A tailor has the following materials available in stock: 16 m 2 of cotton, 11 m 2 of silk and 15 m.
1 Chapter 4 Planning Models Operations Analysis Using MS Excel.
Types of IP Models All-integer linear programs Mixed integer linear programs (MILP) Binary integer linear programs, mixed or all integer: some or all of.
Managerial Economics Prof. M. El-Sakka CBA. Kuwait University Managerial Economics in a Global Economy Chapter 2 Optimization Techniques and New Management.
Microeconomics 2 John Hey. Health Warning There is a LOT of detail in the Maple html file. Do not be swamped by this detail. Stand back and try and understand.
Optimization using LP models Repco Pharmaceuticals (Ex 4.6) Ravi Krishna Ravula Dsc 8240.
DAY 10: EXCEL CHAPTER 8, 9, 10 Tazin Afrin September 23,
Nonlinear Programming Models
Managerial Economics Managerial Economics = economic theory + mathematical eco + statistical analysis.
1 Multi-Objective Portfolio Optimization Jeremy Eckhause AMSC 698S Professor S. Gabriel 6 December 2004.
AGEC 317 Introductory Calculus: Marginal Analysis.
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.
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.
Econ 201/202 Review of Essential Math and Graphing Skills.
Introduction to Optimization
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
C opyright  2007 by Oxford University Press, Inc. PowerPoint Slides Prepared by Robert F. Brooker, Ph.D.Slide 1 1.
Chapter 3 Section 3.7 Graphing Linear Inequalities.
Econ 201/202 Review of Essential Math and Graphing Skills.
COST ANALYSIS CHAPTER # 5. Meaning of Cost  By cost we mean “The total sum of money required for the production of specific quantity of a good or service.
EMGT 5412 Operations Management Science Nonlinear Programming: Introduction Dincer Konur Engineering Management and Systems Engineering 1.
Chapter 6 PRODUCTION. CHAPTER 6 OUTLINE 6.1The Technology of Production 6.2Production with One Variable Input (Labor) 6.3Production with Two Variable.
Calculus-Based Optimization Prepared by Lee Revere and John Large
Solver & Optimization Problems
An Animated Instructional Module
Asst. Prof. Dr. Serdar AYAN
3-3 Optimization with Linear Programming
Presentation transcript:

Chapter 7 Nonlinear Optimization Models

Introduction The objective and/or the constraints are nonlinear functions of the decision variables. Select GRG Nonlinear in Solver The Solver solution may not be optimal

Reasons for nonlinearity the effect of some input on some output is nonlinear In pricing models where price is the decision variable, and quantity sold is related to price, revenue is really price multiplied by a function of price – which is nonlinear Goodness of the fit requires minimizing sum of squared differences. The squaring introduces nonlinearity. Financial models try to achieve high return and low risk. Variance (or standard deviation) is used to meaure risk and it is nonlinear.

Local and global optimum For the figure graphed below, points A and C are called local maxima Only point A is the global maximum. If Solver finds point C first it will stop and present it as the best solution

Convex functions A function of one variable is convex in a region if its slope (rate of change) in that region is always nondecreasing. i.e.. if a line drawn connecting two points the curve is always below the curve.

Concave functions A function is concave if its slope is always nonincreasing In other words, if a line is drawn connecting two points the curve is always above the line

Properties of concave and convex functions Sum of convex/concave functions is convex/ concave. Convex/concave functions multiplied by a positive constant is convex/concave Convex/concave functions multiplied by a negative constant will result in concave/convex.

Solver: GRG nonlinear Solver is guaranteed to find the global optimum if: – for maximization problems: (a) the objective function is concave or the logarithm of the objective function is concave, and (b) the constraints are linear. – Conditions for minimization problems: (a) the objective function is convex, and (b) the constraints are linear.

Solver: GRG nonlinear If the previous conditions are not true do the following: 1.Try several possible starting (initial) values for the changing cells, 2.Run Solver from each of these, and 3.Take the best solution Solver finds. In Solver this can be done using Multi-start option

Solver multi-start option