Tutorial Letter 204/1/2016 DSC2606. Semester 2. Nonlinear mathematical programming. Department of Decision Sciences. Solutions: Assignment 04
|
|
- Dorcas Lee
- 5 years ago
- Views:
Transcription
1 DSC2606/204//206 Tutorial Letter 204//206 Nonlinear mathematical programming DSC2606 Semester 2 Department of Decision Sciences Solutions: Assignment 04 This tutorial letter contains solutions to the questions in Assignment 04. Bar code Learn without limits. university of south africa
2 DSC2606/204/ 2 Dear Student Here are the solutions to the fourth compulsory assignment. You are welcome to contact your lecturer if you have any queries. The relevant information is available on the module s myunisa page.
3 3 DSC2606/204/ Answer to question The formula for compound interest is as follows: Solutions: Assignment 04 First semester A = P(+r) t and I = A P where A is the amount which accrues when an initial principal of P is invested at interest rate r per term for t terms, and where I is the compound interest. (a) For which value(s) of t is A a linear function of r? If t =, then A = P(+r), which is a linear function of r. (b) For which value(s) of t is A a nonlinear function of r? A = P(+r) t is a nonlinear function of r for 0 < t < and t >, that is, if t. (c) Determine da/dr. da dr = tp(+r)t (d) Derive an expression for t in terms of A, P and r. Derive an expression for t from A = P(+r) t : (+r) t = A P Take natural logarithm both sides: ln(+r) t = ln ( ) A P But ln(+r) t = tln(+r) Therefore t = ( ) A ln P ln(+r) (e) At what interest rate per annum must money be invested if the accrued principal must treble in ten years?
4 DSC2606/204/ 4 Now t = 0 and A P = 3. Therefore ( ) A ln P ln(+r) = t = ln3 0 = 0,0986 = K r = e K = 0,6 The accrued principal will treble in ten years at an interest rate of,6% per annum. Answer to question 2 The total cost T(n) (in rand) of ordering, purchasing, and storing inventory for a year is given by the cost equation T(n) = n n where n is the order quantity per order. (a) Prove that the function T(n) is convex over the interval (0; ). The total cost function is T(n) = n +2n = n +2n T (n) = n T (n) = n 3 > 0 because n > 0. Therefore T(n) is convex over the interval (0; ). (b) Determine the optimal order quantity. (Which n minimises T(n)?) The optimal order quantity n is where T (n) = 0. T (n) = n 2 +2 = 0 n 2 = n = 200 because n 0.
5 5 DSC2606/204/ Answer to question 3 Determine the optimal solution to the following nonlinear programming (NLP) problem: Maximise f(x) = e x subject to x 3. Show your reasoning. f(x) = e x (a) f (x) = e x.( ) = e x > 0 for all x. There is no solution to f (x) = 0; so no stationary points or relative extreme points within the feasible region. The function f(x) is increasing. (b) f (x) = e x.( ) = e x < 0 for all x. The function f(x) is concave. The maximum must therefore be on the boundary of the feasible region x 3, i.e. either at x = or at x = 3. Answer to question 4 Consider the cubic function f(x) = x 3 9x 2 +5x+74. (a) Determine the stationary points of the function f(x) and prove their nature (relative minimum or maximum) by applying the second derivative test. f(x) = x 3 9x 2 +5x+74 The first and second derivatives are f (x) = 3x 2 8x+5 f (x) = 6x 8. Stationary points are where f (x) = 0: 3x 2 8x+5 = 0 3(x 2 6x+5) = 0 3(x )(x 5) = 0 x = and x = 5.
6 DSC2606/204/ 6 Second derivative test: Evaluate f (x) at the stationary points: f () = 6() 8 = 2 < 0 relative maximum f (5) = 6(5) 8 = +2 > 0 relative minimum. The corresponding f(x) values at the stationary points are f() = 8 f(5) = 49. The point (;8) is a relative maximum and the point (5;49) is a relative minimum of f(x). (b) Determine the inflection point(s) of the function f(x). Inflection point(s) are where f (x) = 0: f (x) = 6x 8 = 0 inflection point at x = 3 As f(3) = 65, the inflection point is (3;65). (c) Determine the interval(s) where the function f(x) is. decreasing. 2. convex. f(x) is. decreasing on the interval (; 5). 2. convex on the interval (3; ). (d) Calculate f( ) en f( 3). From this, derive a meaningful starting interval for applying the bisection algorithm in determining a real root of the equation f(x) = 0. Calculate function values:. f( ) = ( ) 3 9( ) 2 +5( )+74 = = f( 3) = ( 3) 3 9( 3) 2 +5( 3)+74 = = 79 Because f( ) > 0 and f( 3) < 0, a meaningful starting interval for the bisection algorithm is [ ; 3].
7 7 DSC2606/204/ Answer to question 5 Find the point on the parabola y = 2 x2 that is closest to the point ( 27 ;) on the Euclidean plane 2 (x;y). Minimise squared distance between the point ( 27 2 ;) and the point (x;y) on the parabola y = 2 x2 NLP formulation Minimise ( 27 2 x)2 +( 2 y)2 subject to y = 2 x2. Substitute for y = 2 x2 in the objective function. f(x) = ( 27 2 x)2 +( 2 x2 ) 2 = ( ) x+x 2 + x x4 = 4 x4 27x Stationary points where f (x) = x 3 27 = 0. x 3 = 27 and x = 3 y = 9 2 Second derivative test: Examine the sign of f (x) = 3x 2 at the stationary point x = 3: f (3) = 3(3) 2 = 27 > 0 relative minimum at x = 3. The squared distance is minimised when x = 3 and y = 9 2. Answer to question 6 The trapezoidal rule is given by b a f(x)dx h n 2 [f(a)+f(b)]+h f(x i ), where the interval [a;b] is divided into n subintervals [x i ;x i+ ] of width h = (b a)/n, with x 0 = a and x n = b. i=
8 DSC2606/204/ 8 (a) Estimate the area under the curve f(x) = 3x+ on the interval [;5] to three decimal places, by applying the trapezoidal rule with n = 2 intervals. (b) By how much does the estimate differ from the actual area? (a) Trapezoidal rule on f(x) = 3x+ over [;5]: a = x 0 = b = x 2 = 5 h = 5 2 = 2 Then 5 i x i 3x i + f(x i ) 0,0 4,00 2,00 3,0 0,00 3, ,0 6,00 4,00 3x+dx = 2 2 [f()+f(5)]+(2)[f(3)] = 2,00+4,00+2 3,623 2,325 (b) Apply fundamental theorem of calculus to determine the actual area under the curve. 5 f(x)dx = 5 5 3x+dx = (3x+) /2 dx = ( ) (3x+)3/2 = 2 ( (3(5)+) 3/2 (3()+) 3/2) = 2 ( 6 3/2 4 3/2) = ( ) = 2 9 (64 8) = 2 (56) = 2,444 9 The error is 2,444 2,325 = 0,2.
9 9 DSC2606/204/ Answer to question 7 Consider the following nonlinear programming (NLP) problem: Minimise f(x;y) = 50 x + 20 y +xy subject to x 3;y 2. (a) Calculate the objective function value for the point (0; 0). Objective function value for the point (0; 0): f(0;0) = (0)(0) = = 07 0 (b) Is the point (; ) a feasible solution to the NLP problem? Substantiate your answer. No, the point (;) is NOT a feasible solution, because both the constraints are violated: x = < 3 and y = < 2 (c) The Kuhn-Tucker necessary conditions for this NLP problem are as follows: Verify whether the point (5; 2) satisfies (a) the Kuhn-Tucker necessary conditions. From (3), x = 5 λ = 0 From (4), y = 2 λ 2 0 Into (): λ = = 0 Into (2): λ 2 = = 0 50x 2 +y λ = 0 () 20y 2 +x λ 2 = 0 (2) λ ( 3 x) = 0 (3) λ 2 ( 2 y) = 0 (4) λ,λ 2 0. (5) Yes, the point (5; 2) satisfies the Kuhn-Tucker necessary conditions. (b) the Kuhn-Tucker sufficient conditions. The second-order partial derivatives are x 2(x;y) = 00x 3 x y (x;y) = 2 f y x (x;y) = y 2(x;y) = 40y 3.
10 DSC2606/204/ 0 The Hessian matrix is [ ] [ ] [ 00x 3 00(5) 3 4 H(x;y) = = = ] 5. 40y 3 40(2) 3 5 The first principal minors are both positive. The second principal minor is 4 5 = 3, which is also positive. 5 Hence all principal minors are nonnegative and hence f(x;y) is a convex function. Therefore the point (x; y) = (5; 2) satisfies the Kuhn-Tucker sufficient conditions. (d) What conclusion about optimality can you draw from this? Conclusion: The point (5;2) is the optimal solution. The maximum objective function value is f(5;2) = (5)(2) = Answer to question 8 Use the method of Lagrange multipliers to solve the following nonlinear programming (NLP) problem: Minimise f(x;y) = 2x 2 +3y 2 +x 9y +6 subject to x+y = 5. The Lagrangian is L(x;y;λ) = 2x 2 +3y 2 +x 9y +6+λ(5 x y). To determine the stationary points of L, set L x = L y = L λ = 0. Then L x = 4x+ λ = 0 x = λ 4 L y L λ = 6y 9 λ = 0 y = λ+9 6 () (2) = 5 x y = 0 x+y = 5. (3)
11 DSC2606/204/ Substitute () and (2) into (3), then λ 4 + λ+9 6 = 5 3λ 3+2λ+8 = 60 5λ = 45 λ = 9. Now x = 9 4 = 2 and y = = 3. The point (x; y; λ) = (2; 3; 9) is a stationary point of L. The function value is f(2;3) = 2(2) 2 +3(3) (3)+6 = 26. We must also prove that (x;y) = (2;3) is indeed the optimal solution. To do this, we must firstly determine the convexity/concavity of the objective function f(x;y) = 2x 2 +3y 2 +x 9y +6. The second-order partial derivatives are x 2 = 4; y 2 = 6; y x = 0; x y = 0. The Hessian matrix is [ ] 4 0 H(x;y) = 0 6. The first principal minors are 4 and 6; both positive. The second principal minor is 24, also positive. All the principal minors are > 0. Therefore, the function f(x;y) is a convex function. Also, the constraint x+y = 5 is linear. We can conclude that the point (x;y) = (2;3), with f(x;y) = 26, is the optimal solution. c UNISA 206
Review of Optimization Methods
Review of Optimization Methods Prof. Manuela Pedio 20550 Quantitative Methods for Finance August 2018 Outline of the Course Lectures 1 and 2 (3 hours, in class): Linear and non-linear functions on Limits,
More informationTutorial letter 201/2/2018
DSC1520/201/2/2018 Tutorial letter 201/2/2018 Quantitative Modelling 1 DSC1520 Semester 2 Department of Decision Sciences Solutions to Assignment 1 Bar code Dear Student This tutorial letter contains the
More informationTutorial 3: Optimisation
Tutorial : Optimisation ECO411F 011 1. Find and classify the extrema of the cubic cost function C = C (Q) = Q 5Q +.. Find and classify the extreme values of the following functions (a) y = x 1 + x x 1x
More informationMore on Lagrange multipliers
More on Lagrange multipliers CE 377K April 21, 2015 REVIEW The standard form for a nonlinear optimization problem is min x f (x) s.t. g 1 (x) 0. g l (x) 0 h 1 (x) = 0. h m (x) = 0 The objective function
More informationMATH2070 Optimisation
MATH2070 Optimisation Nonlinear optimisation with constraints Semester 2, 2012 Lecturer: I.W. Guo Lecture slides courtesy of J.R. Wishart Review The full nonlinear optimisation problem with equality constraints
More informationConstrained Optimization
1 / 22 Constrained Optimization ME598/494 Lecture Max Yi Ren Department of Mechanical Engineering, Arizona State University March 30, 2015 2 / 22 1. Equality constraints only 1.1 Reduced gradient 1.2 Lagrange
More informationGeneralization to inequality constrained problem. Maximize
Lecture 11. 26 September 2006 Review of Lecture #10: Second order optimality conditions necessary condition, sufficient condition. If the necessary condition is violated the point cannot be a local minimum
More informationNumerical Optimization
Constrained Optimization Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on Constrained Optimization Constrained Optimization Problem: min h j (x) 0,
More informationContents. Preface. 1 Introduction Optimization view on mathematical models NLP models, black-box versus explicit expression 3
Contents Preface ix 1 Introduction 1 1.1 Optimization view on mathematical models 1 1.2 NLP models, black-box versus explicit expression 3 2 Mathematical modeling, cases 7 2.1 Introduction 7 2.2 Enclosing
More informationApril 9, 2009 Name The problems count as marked. The total number of points available is 160. Throughout this test, show your work.
April 9, 009 Name The problems count as marked The total number of points available is 160 Throughout this test, show your work 1 (15 points) Consider the cubic curve f(x) = x 3 + 3x 36x + 17 (a) Build
More informationIE 5531: Engineering Optimization I
IE 5531: Engineering Optimization I Lecture 12: Nonlinear optimization, continued Prof. John Gunnar Carlsson October 20, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I October 20,
More informationEXAM 3 MAT 167 Calculus I Spring is a composite function of two functions y = e u and u = 4 x + x 2. By the. dy dx = dy du = e u x + 2x.
EXAM MAT 67 Calculus I Spring 20 Name: Section: I Each answer must include either supporting work or an explanation of your reasoning. These elements are considered to be the main part of each answer and
More informationCalculus I Practice Exam 3B
Calculus I Practice Exam 3B This practice exam emphasizes conceptual connections and understanding to a greater degree than the exams that are usually administered in introductory single-variable calculus
More informationMath RE - Calculus II Antiderivatives and the Indefinite Integral Page 1 of 5
Math 201-203-RE - Calculus II Antiderivatives and the Indefinite Integral Page 1 of 5 What is the Antiderivative? In a derivative problem, a function f(x) is given and you find the derivative f (x) using
More informationSeptember Math Course: First Order Derivative
September Math Course: First Order Derivative Arina Nikandrova Functions Function y = f (x), where x is either be a scalar or a vector of several variables (x,..., x n ), can be thought of as a rule which
More informationMATH 1014 Tutorial Notes 8
MATH4 Calculus II (8 Spring) Topics covered in tutorial 8:. Numerical integration. Approximation integration What you need to know: Midpoint rule & its error Trapezoid rule & its error Simpson s rule &
More informationApplied Calculus I. Lecture 36
Applied Calculus I Lecture 36 Computing the volume Consider a continuous function over an interval [a, b]. y a b x Computing the volume Consider a continuous function over an interval [a, b]. y y a b x
More informationSECTION C: CONTINUOUS OPTIMISATION LECTURE 11: THE METHOD OF LAGRANGE MULTIPLIERS
SECTION C: CONTINUOUS OPTIMISATION LECTURE : THE METHOD OF LAGRANGE MULTIPLIERS HONOUR SCHOOL OF MATHEMATICS OXFORD UNIVERSITY HILARY TERM 005 DR RAPHAEL HAUSER. Examples. In this lecture we will take
More informationLesson 11. Lagrange's Multiplier Rule / Constrained Optimization
Module 1: Differential Calculus Lesson 11 Lagrange's Multiplier Rule / Constrained Optimization 11.1 Introduction We presents an introduction to optimization problems that involve finding a maximum or
More informationLagrange Multipliers
Lagrange Multipliers (Com S 477/577 Notes) Yan-Bin Jia Nov 9, 2017 1 Introduction We turn now to the study of minimization with constraints. More specifically, we will tackle the following problem: minimize
More information2.6 Logarithmic Functions. Inverse Functions. Question: What is the relationship between f(x) = x 2 and g(x) = x?
Inverse Functions Question: What is the relationship between f(x) = x 3 and g(x) = 3 x? Question: What is the relationship between f(x) = x 2 and g(x) = x? Definition (One-to-One Function) A function f
More informationMA EXAM 2 Form A
MA 22400 EXAM 2 Form A. You must use a #2 pencil on the scantron answer sheet. 2. Fill in your name, your four digit section number, and your student identification number. If you do not know your section
More informationLinear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers)
Support vector machines In a nutshell Linear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers) Solution only depends on a small subset of training
More informationSECTION C: CONTINUOUS OPTIMISATION LECTURE 9: FIRST ORDER OPTIMALITY CONDITIONS FOR CONSTRAINED NONLINEAR PROGRAMMING
Nf SECTION C: CONTINUOUS OPTIMISATION LECTURE 9: FIRST ORDER OPTIMALITY CONDITIONS FOR CONSTRAINED NONLINEAR PROGRAMMING f(x R m g HONOUR SCHOOL OF MATHEMATICS, OXFORD UNIVERSITY HILARY TERM 5, DR RAPHAEL
More informationDEPARTMENT OF MANAGEMENT AND ECONOMICS Royal Military College of Canada. ECE Modelling in Economics Instructor: Lenin Arango-Castillo
Page 1 of 5 DEPARTMENT OF MANAGEMENT AND ECONOMICS Royal Military College of Canada ECE 256 - Modelling in Economics Instructor: Lenin Arango-Castillo Final Examination 13:00-16:00, December 11, 2017 INSTRUCTIONS
More informationLearning Target: I can sketch the graphs of rational functions without a calculator. a. Determine the equation(s) of the asymptotes.
Learning Target: I can sketch the graphs of rational functions without a calculator Consider the graph of y= f(x), where f(x) = 3x 3 (x+2) 2 a. Determine the equation(s) of the asymptotes. b. Find the
More informationSTA2603/205/1/2014 /2014. ry II. Tutorial letter 205/1/
STA263/25//24 Tutorial letter 25// /24 Distribution Theor ry II STA263 Semester Department of Statistics CONTENTS: Examination preparation tutorial letterr Solutions to Assignment 6 2 Dear Student, This
More informationApplications of Linear Programming
Applications of Linear Programming lecturer: András London University of Szeged Institute of Informatics Department of Computational Optimization Lecture 9 Non-linear programming In case of LP, the goal
More information2015 Math Camp Calculus Exam Solution
015 Math Camp Calculus Exam Solution Problem 1: x = x x +5 4+5 = 9 = 3 1. lim We also accepted ±3, even though it is not according to the prevailing convention 1. x x 4 x+4 =. lim 4 4+4 = 4 0 = 4 0 = We
More informationModern Optimization Theory: Concave Programming
Modern Optimization Theory: Concave Programming 1. Preliminaries 1 We will present below the elements of modern optimization theory as formulated by Kuhn and Tucker, and a number of authors who have followed
More informationII. An Application of Derivatives: Optimization
Anne Sibert Autumn 2013 II. An Application of Derivatives: Optimization In this section we consider an important application of derivatives: finding the minimum and maximum points. This has important applications
More informationThe general programming problem is the nonlinear programming problem where a given function is maximized subject to a set of inequality constraints.
1 Optimization Mathematical programming refers to the basic mathematical problem of finding a maximum to a function, f, subject to some constraints. 1 In other words, the objective is to find a point,
More informationConstrained Optimization and Lagrangian Duality
CIS 520: Machine Learning Oct 02, 2017 Constrained Optimization and Lagrangian Duality Lecturer: Shivani Agarwal Disclaimer: These notes are designed to be a supplement to the lecture. They may or may
More informationLink lecture - Lagrange Multipliers
Link lecture - Lagrange Multipliers Lagrange multipliers provide a method for finding a stationary point of a function, say f(x, y) when the variables are subject to constraints, say of the form g(x, y)
More informationMath Final Solutions - Spring Jaimos F Skriletz 1
Math 160 - Final Solutions - Spring 2011 - Jaimos F Skriletz 1 Answer each of the following questions to the best of your ability. To receive full credit, answers must be supported by a sufficient amount
More informationLectures 9 and 10: Constrained optimization problems and their optimality conditions
Lectures 9 and 10: Constrained optimization problems and their optimality conditions Coralia Cartis, Mathematical Institute, University of Oxford C6.2/B2: Continuous Optimization Lectures 9 and 10: Constrained
More informationLinear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers)
Support vector machines In a nutshell Linear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers) Solution only depends on a small subset of training
More information3. (12 points) Find an equation for the line tangent to the graph of f(x) =
April 8, 2015 Name The total number of points available is 168 Throughout this test, show your work Throughout this test, you are expected to use calculus to solve problems Graphing calculator solutions
More informationEC /11. Math for Microeconomics September Course, Part II Problem Set 1 with Solutions. a11 a 12. x 2
LONDON SCHOOL OF ECONOMICS Professor Leonardo Felli Department of Economics S.478; x7525 EC400 2010/11 Math for Microeconomics September Course, Part II Problem Set 1 with Solutions 1. Show that the general
More informationUniversidad Carlos III de Madrid
Universidad Carlos III de Madrid Question 1 3 4 5 6 Total Grade Economics Department Final Exam, Mathematics I January 14, 011 Total length: hours. SURNAME: NAME: DNI: Degree: Group: { 4(x 4) if 3 x 4
More informationExample. Determine the inverse of the given function (if it exists). f(x) = 3
Example. Determine the inverse of the given function (if it exists). f(x) = g(x) = p x + x We know want to look at two di erent types of functions, called logarithmic functions and exponential functions.
More informationGRADE 12 SEPTEMBER 2012 MATHEMATICS P1
Province of the EASTERN CAPE EDUCATION NATIONAL SENIOR CERTIFICATE GRADE 12 SEPTEMBER 2012 MATHEMATICS P1 MARKS: 150 TIME: 3 hours *MATHE1* This question paper consists of 8 pages, 3 diagram sheets and
More informationMATH 111: EXAM 03 BLAKE FARMAN UNIVERSITY OF SOUTH CAROLINA
MATH 111: EXAM 03 BLAKE FARMAN UNIVERSITY OF SOUTH CAROLINA Answer the questions in the spaces provided on the question sheets and turn them in at the end of the class period Unless otherwise stated, all
More informationSufficient Conditions for Finite-variable Constrained Minimization
Lecture 4 It is a small de tour but it is important to understand this before we move to calculus of variations. Sufficient Conditions for Finite-variable Constrained Minimization ME 256, Indian Institute
More informationCalculus Example Exam Solutions
Calculus Example Exam Solutions. Limits (8 points, 6 each) Evaluate the following limits: p x 2 (a) lim x 4 We compute as follows: lim p x 2 x 4 p p x 2 x +2 x 4 p x +2 x 4 (x 4)( p x + 2) p x +2 = p 4+2
More informationCPT Solved Scanner (English) : Appendix 71
CPT Solved Scanner (English) : Appendix 71 Paper-4: Quantitative Aptitude Chapter-1: Ratio and Proportion, Indices and Logarithm [1] (b) The integral part of a logarithms is called Characteristic and the
More informationFinal Exam Review (Section 8.3 and Review of Other Sections)
c Kathryn Bollinger, April 29, 2014 1 Final Exam Review (Section 8.3 and Review of Other Sections) Note: This collection of questions is intended to be a brief overview of the material covered throughout
More informationnt and A = Pe rt to solve. 3) Find the accumulated value of an investment of $10,000 at 4% compounded semiannually for 5 years.
Exam 4 Review Approximate the number using a calculator. Round your answer to three decimal places. 1) 2 1.7 2) e -1.4 Use the compound interest formulas A = P 1 + r n nt and A = Pe rt to solve. 3) Find
More informationResources: http://www.calcchat.com/book/calculus-9e/ http://apcentral.collegeboard.com/apc/public/courses/teachers_corner/27.html http://www.calculus.org/ http://cow.math.temple.edu/ http://www.mathsisfun.com/calculus/
More informationSOLUTIONS FOR PRACTICE FINAL EXAM
SOLUTIONS FOR PRACTICE FINAL EXAM ANDREW J. BLUMBERG. Solutions () Short answer questions: (a) State the mean value theorem. Proof. The mean value theorem says that if f is continuous on (a, b) and differentiable
More informationUNIVERSITY of LIMERICK
UNIVERSITY of LIMERICK OLLSCOIL LUIMNIGH Faculty of Science and Engineering Department of Mathematics & Statistics END OF SEMESTER ASSESSMENT PAPER MODULE CODE: MA4701 SEMESTER: Autumn 2011/12 MODULE TITLE:
More informationIntroduction to Machine Learning Lecture 7. Mehryar Mohri Courant Institute and Google Research
Introduction to Machine Learning Lecture 7 Mehryar Mohri Courant Institute and Google Research mohri@cims.nyu.edu Convex Optimization Differentiation Definition: let f : X R N R be a differentiable function,
More informationN. L. P. NONLINEAR PROGRAMMING (NLP) deals with optimization models with at least one nonlinear function. NLP. Optimization. Models of following form:
0.1 N. L. P. Katta G. Murty, IOE 611 Lecture slides Introductory Lecture NONLINEAR PROGRAMMING (NLP) deals with optimization models with at least one nonlinear function. NLP does not include everything
More information3. Minimization with constraints Problem III. Minimize f(x) in R n given that x satisfies the equality constraints. g j (x) = c j, j = 1,...
3. Minimization with constraints Problem III. Minimize f(x) in R n given that x satisfies the equality constraints g j (x) = c j, j = 1,..., m < n, where c 1,..., c m are given numbers. Theorem 3.1. Let
More informationMath Refresher Course
Math Refresher Course Columbia University Department of Political Science Fall 2007 Day 2 Prepared by Jessamyn Blau 6 Calculus CONT D 6.9 Antiderivatives and Integration Integration is the reverse of differentiation.
More informationX. Numerical Methods
X. Numerical Methods. Taylor Approximation Suppose that f is a function defined in a neighborhood of a point c, and suppose that f has derivatives of all orders near c. In section 5 of chapter 9 we introduced
More informationLakehead University ECON 4117/5111 Mathematical Economics Fall 2002
Test 1 September 20, 2002 1. Determine whether each of the following is a statement or not (answer yes or no): (a) Some sentences can be labelled true and false. (b) All students should study mathematics.
More informationMath 10C - Fall Final Exam
Math 1C - Fall 217 - Final Exam Problem 1. Consider the function f(x, y) = 1 x 2 (y 1) 2. (i) Draw the level curve through the point P (1, 2). Find the gradient of f at the point P and draw the gradient
More informationA Project Report Submitted by. Devendar Mittal 410MA5096. A thesis presented for the degree of Master of Science
PARTICULARS OF NON-LINEAR OPTIMIZATION A Project Report Submitted by Devendar Mittal 410MA5096 A thesis presented for the degree of Master of Science Department of Mathematics National Institute of Technology,
More informationFACULTY OF ARTS AND SCIENCE University of Toronto FINAL EXAMINATIONS, APRIL 2012 MAT 133Y1Y Calculus and Linear Algebra for Commerce
FACULTY OF ARTS AND SCIENCE University of Toronto FINAL EXAMINATIONS, APRIL 0 MAT 33YY Calculus and Linear Algebra for Commerce Duration: Examiners: 3 hours N. Francetic A. Igelfeld P. Kergin J. Tate LEAVE
More informationLinear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers)
Support vector machines In a nutshell Linear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers) Solution only depends on a small subset of training
More informationReview for the Final Exam
Math 171 Review for the Final Exam 1 Find the limits (4 points each) (a) lim 4x 2 3; x x (b) lim ( x 2 x x 1 )x ; (c) lim( 1 1 ); x 1 ln x x 1 sin (x 2) (d) lim x 2 x 2 4 Solutions (a) The limit lim 4x
More informationCalculus Overview. f(x) f (x) is slope. I. Single Variable. A. First Order Derivative : Concept : measures slope of curve at a point.
Calculus Overview I. Single Variable A. First Order Derivative : Concept : measures slope of curve at a point. Notation : Let y = f (x). First derivative denoted f ʹ (x), df dx, dy dx, f, etc. Example
More informationSchool of Business. Blank Page
Maxima and Minima 9 This unit is designed to introduce the learners to the basic concepts associated with Optimization. The readers will learn about different types of functions that are closely related
More informationSTUDY MATERIALS. (The content of the study material is the same as that of Chapter I of Mathematics for Economic Analysis II of 2011 Admn.
STUDY MATERIALS MATHEMATICAL TOOLS FOR ECONOMICS III (The content of the study material is the same as that of Chapter I of Mathematics for Economic Analysis II of 2011 Admn.) & MATHEMATICAL TOOLS FOR
More informationUnit #24 - Lagrange Multipliers Section 15.3
Unit #24 - Lagrange Multipliers Section 1.3 Some material from Calculus, Single and MultiVariable by Hughes-Hallett, Gleason, McCallum et. al. Copyright 200 by John Wiley & Sons, Inc. This material is
More informationSecond Order Optimality Conditions for Constrained Nonlinear Programming
Second Order Optimality Conditions for Constrained Nonlinear Programming Lecture 10, Continuous Optimisation Oxford University Computing Laboratory, HT 2006 Notes by Dr Raphael Hauser (hauser@comlab.ox.ac.uk)
More informationOptimization. Charles J. Geyer School of Statistics University of Minnesota. Stat 8054 Lecture Notes
Optimization Charles J. Geyer School of Statistics University of Minnesota Stat 8054 Lecture Notes 1 One-Dimensional Optimization Look at a graph. Grid search. 2 One-Dimensional Zero Finding Zero finding
More informationIndex. Cambridge University Press An Introduction to Mathematics for Economics Akihito Asano. Index.
, see Q.E.D. ln, see natural logarithmic function e, see Euler s e i, see imaginary number log 10, see common logarithm ceteris paribus, 4 quod erat demonstrandum, see Q.E.D. reductio ad absurdum, see
More informationBEKG 2452 NUMERICAL METHODS Solution of Nonlinear Equations
BEKG 2452 NUMERICAL METHODS Solution of Nonlinear Equations Ser Lee Loh a, Wei Sen Loi a a Fakulti Kejuruteraan Elektrik Universiti Teknikal Malaysia Melaka Lesson Outcome Upon completion of this lesson,
More informationx +3y 2t = 1 2x +y +z +t = 2 3x y +z t = 7 2x +6y +z +t = a
UCM Final Exam, 05/8/014 Solutions 1 Given the parameter a R, consider the following linear system x +y t = 1 x +y +z +t = x y +z t = 7 x +6y +z +t = a (a (6 points Discuss the system depending on the
More informationSupport Vector Machine
Andrea Passerini passerini@disi.unitn.it Machine Learning Support vector machines In a nutshell Linear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers)
More informationBasics of Calculus and Algebra
Monika Department of Economics ISCTE-IUL September 2012 Basics of linear algebra Real valued Functions Differential Calculus Integral Calculus Optimization Introduction I A matrix is a rectangular array
More informationSeminars on Mathematics for Economics and Finance Topic 5: Optimization Kuhn-Tucker conditions for problems with inequality constraints 1
Seminars on Mathematics for Economics and Finance Topic 5: Optimization Kuhn-Tucker conditions for problems with inequality constraints 1 Session: 15 Aug 2015 (Mon), 10:00am 1:00pm I. Optimization with
More informationSTATIC LECTURE 4: CONSTRAINED OPTIMIZATION II - KUHN TUCKER THEORY
STATIC LECTURE 4: CONSTRAINED OPTIMIZATION II - KUHN TUCKER THEORY UNIVERSITY OF MARYLAND: ECON 600 1. Some Eamples 1 A general problem that arises countless times in economics takes the form: (Verbally):
More information4 Exponential and Logarithmic Functions
4 Exponential and Logarithmic Functions 4.1 Exponential Functions Definition 4.1 If a > 0 and a 1, then the exponential function with base a is given by fx) = a x. Examples: fx) = x, gx) = 10 x, hx) =
More informationCalculus I Practice Final Exam B
Calculus I Practice Final Exam B This practice exam emphasizes conceptual connections and understanding to a greater degree than the exams that are usually administered in introductory single-variable
More informationAlgebra III: Blizzard Bag #1 Exponential and Logarithm Functions
NAME : DATE: PERIOD: Algebra III: Blizzard Bag #1 Exponential and Logarithm Functions Students need to complete the following assignment, which will aid in review for the end of course exam. Look back
More informationExponential and Logarithmic Functions. Copyright Cengage Learning. All rights reserved.
Exponential and Logarithmic Functions Copyright Cengage Learning. All rights reserved. 4.5 Exponential and Logarithmic Equations Copyright Cengage Learning. All rights reserved. Objectives Exponential
More informationCalculus and optimization
Calculus an optimization These notes essentially correspon to mathematical appenix 2 in the text. 1 Functions of a single variable Now that we have e ne functions we turn our attention to calculus. A function
More informationNonlinear Programming (NLP)
Natalia Lazzati Mathematics for Economics (Part I) Note 6: Nonlinear Programming - Unconstrained Optimization Note 6 is based on de la Fuente (2000, Ch. 7), Madden (1986, Ch. 3 and 5) and Simon and Blume
More informationOptimization Theory. Lectures 4-6
Optimization Theory Lectures 4-6 Unconstrained Maximization Problem: Maximize a function f:ú n 6 ú within a set A f ú n. Typically, A is ú n, or the non-negative orthant {x0ú n x$0} Existence of a maximum:
More informationg(x,y) = c. For instance (see Figure 1 on the right), consider the optimization problem maximize subject to
1 of 11 11/29/2010 10:39 AM From Wikipedia, the free encyclopedia In mathematical optimization, the method of Lagrange multipliers (named after Joseph Louis Lagrange) provides a strategy for finding the
More informationISM206 Lecture Optimization of Nonlinear Objective with Linear Constraints
ISM206 Lecture Optimization of Nonlinear Objective with Linear Constraints Instructor: Prof. Kevin Ross Scribe: Nitish John October 18, 2011 1 The Basic Goal The main idea is to transform a given constrained
More informationdollars for a week of sales t weeks after January 1. What is the total revenue (to the nearest hundred dollars) earned from t = 10 to t = 16?
MATH 7 RIOHONDO SPRING 7 TEST (TAKE HOME) DUE 5//7 NAME: SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question. ) A department store has revenue from the sale
More informationDay 2 Notes: Riemann Sums In calculus, the result of f ( x)
AP Calculus Unit 6 Basic Integration & Applications Day 2 Notes: Riemann Sums In calculus, the result of f ( x) dx is a function that represents the anti-derivative of the function f(x). This is also sometimes
More informationwhere u is the decision-maker s payoff function over her actions and S is the set of her feasible actions.
Seminars on Mathematics for Economics and Finance Topic 3: Optimization - interior optima 1 Session: 11-12 Aug 2015 (Thu/Fri) 10:00am 1:00pm I. Optimization: introduction Decision-makers (e.g. consumers,
More informationOBJECTIVES Use the area under a graph to find total cost. Use rectangles to approximate the area under a graph.
4.1 The Area under a Graph OBJECTIVES Use the area under a graph to find total cost. Use rectangles to approximate the area under a graph. 4.1 The Area Under a Graph Riemann Sums (continued): In the following
More informationWeek 12: Optimisation and Course Review.
Week 12: Optimisation and Course Review. MA161/MA1161: Semester 1 Calculus. Prof. Götz Pfeiffer School of Mathematics, Statistics and Applied Mathematics NUI Galway November 21-22, 2016 Assignments. Problem
More informationExponential and Logarithmic Functions
Öğr. Gör. Volkan ÖĞER FBA 1021 Calculus 1/ 40 Exponential and Logarithmic Functions Exponential Functions The functions of the form f(x) = b x, for constant b, are important in mathematics, business, economics,
More informationStudy Guide. Quantitative Modelling 1 DSC1520. Semesters 1 and 2. Department of Decision Sciences. Bar code
Study Guide Quantitative Modelling 1 DSC1520 Semesters 1 and 2 Department of Decision Sciences This document contains guidelines to be used together with the prescribed textbook Essential Mathematics for
More informationMULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. B) 6x + 4
Math1420 Review Comprehesive Final Assessment Test Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Add or subtract as indicated. x + 5 1) x2
More informationNonlinear Optimization: What s important?
Nonlinear Optimization: What s important? Julian Hall 10th May 2012 Convexity: convex problems A local minimizer is a global minimizer A solution of f (x) = 0 (stationary point) is a minimizer A global
More informationCheng Soon Ong & Christian Walder. Canberra February June 2018
Cheng Soon Ong & Christian Walder Research Group and College of Engineering and Computer Science Canberra February June 2018 Outlines Overview Introduction Linear Algebra Probability Linear Regression
More informationMSc Mas6002, Introductory Material Mathematical Methods Exercises
MSc Mas62, Introductory Material Mathematical Methods Exercises These exercises are on a range of mathematical methods which are useful in different parts of the MSc, especially calculus and linear algebra.
More informationMath Camp. September 16, 2017 Unit 2. MSSM Program Columbia University Dr. Satyajit Bose
Math Camp September 16, 2017 Unit 2 MSSM Program Columbia University Dr. Satyajit Bose Math Camp Interlude Partial Derivatives Recall:The derivative f'(x) of a function f(x) is the slope of f(x). Alternatively,
More informationCS-E4830 Kernel Methods in Machine Learning
CS-E4830 Kernel Methods in Machine Learning Lecture 3: Convex optimization and duality Juho Rousu 27. September, 2017 Juho Rousu 27. September, 2017 1 / 45 Convex optimization Convex optimisation This
More informationCE 191: Civil & Environmental Engineering Systems Analysis. LEC 17 : Final Review
CE 191: Civil & Environmental Engineering Systems Analysis LEC 17 : Final Review Professor Scott Moura Civil & Environmental Engineering University of California, Berkeley Fall 2014 Prof. Moura UC Berkeley
More informationCalculus 221 worksheet
Calculus 221 worksheet Graphing A function has a global maximum at some a in its domain if f(x) f(a) for all other x in the domain of f. Global maxima are sometimes also called absolute maxima. A function
More informationPre-Calc 2nd Semester Review Packet - #2
Pre-Calc 2nd Semester Review Packet - #2 Use the graph to determine the function's domain and range. 1) 2) Find the domain of the rational function. 3) h(x) = x + 8 x2-36 A) {x x -6, x 6, x -8} B) all
More information