Math Camp Notes: Constrained Optimization
|
|
- Jessie Clark
- 7 years ago
- Views:
Transcription
1 Math Camp Notes: Constrained Optimization Consider the following general constrained optimization problem: g 1 (x 1,, x n ) b 1,, g k (x 1,, x n ) b k, h 1 (x 1,, x n ) = c 1,, h k (x 1,, x n ) = c k The function f(x) is called the objective equation, g(x) is called an inequality constraint, and h(x) is called an equality constraint Notice that this problem diers from the regular unconstrained optimization problem in that instead of nding the extrema of the curve f(x), we are nding the extrema of f(x) only at points which satisfy the constraints Maximize f(x) = x 2 subject to 0 x 1 Solution: We know that f(x) is strictly monotonically increasing over the domain, therefore the maximum (if it exists) must lie at the largest number in the domain Since we are optimizing over a compact set, the point x = 1 is the maximal number in the domain, and therefore it is the maximum This problem was easy because we could visualize the graph of f(x) in our minds and see that it was strictly monotonically increasing over the domain However, we see a method to nd constrained extrema of functions even when we can't picture them in our minds Equality Constraints One Constraint Consider a simple optimization problem with only one constraint: x R h(x 1,, x n ) = c Now draw level sets of the function f(x 1,, x n ) Since we might not be able to achieve the unconstrained extrema of the function due to our constraint, we seek to nd the value of x which gets us onto the highest level curve of f(x) while remaining on the function h(x) Notice also that the function h(x) will be just tangent to the level curve of f(x) Call the point which maximizes the optimization problem x Since at x the level curve of f(x) is tangent to the curve g(x), it must also be the case that the gradient of f(x ) must be in the same direction as the gradient of h(x ), or f(x ) = λ h(x ), where λ is merely a constant Expanding this formula, we have df = λ dh df λ dh = 0 df = λ dh df λ dh = 0 dx n dx n dx n dx n Integrate each equation to get f λh C = 0 1
2 Therefore, when we derivate this equation, we get our previously stated condition on the gradient Since this equation yields the proper rst order condition for all C, it yields the proper rst order condition when C = λc Call the equation when C = λc the Lagrangean L(x 1,, x n, λ) = f(x 1,, x n ) λ [h(x 1,, x n ) c] Taking the partial derivatives of this function will yield the rst order conditions for an extrema The reason we have C = λc is so that taking the derivative of the Lagrangean will yield our equality constraint Maximize f(x 1, x 2 ) = x 1 x 2 subject to h(x 1, x 2 ) x 1 + 4x 2 = 16 Solution: Form the lagrangean The rst order conditions are From the rst two equations we have L(x 1, x 2 ) = x 1 x 2 λ (x 1 + 4x 2 16) = x 2 λ = 0 dx 2 = x 1 4λ = 0 dλ = x 1 + 4x 2 16 = 0 x 1 = 4x 2 Plugging this into the last equation we have that x 2 = 2, which in turn implies that x 1 = 8, and that λ = 2 This states that the only candidate for the solution is (x 1, x 2, λ) = (8, 2, 2) Remember that points obtained using this formula may or may not be a maximum or minimum, since the rst order conditions are only necessary conditions They only give us candidate solutions There is another more subtle way that this process may fail, however Consider the case where h(x ) = 0, or in other words, the point which maximizes f(x) is also a critical point of h(x) Remember our necessary condition for a maximum f(x ) = λ h(x ), Since h(x ) = 0, this implies that f(x ) = 0 However, this the necessary condition for an unconstrained optimization problem, not a constrained one! In eect, when h(x ) = 0, the constraint is no longer taken into account in the problem, and therefore we arrive at the wrong solution Many Constraints Consider the problem h 1 (x 1,, x n ) = c 1,, h m (x 1,, x n ) = c m Lets rst talk about how this might fail As we saw for one constraint, if h(x ) = 0, then the constraint drops out of the equation Now consider the Jacobian matrix, or a vector of the gradients of the dierent h i (x ) Dh(x ) = h 1 (x ) h m (x ) = dh 1(x ) dh 1(x ) dx n dh m(x ) dh m(x ) dx n Notice that if and of the h i (x )'s is zero, then that constraint will not be taken into account in the analysis Also, there will be a row of zeros in the Jacobian, and therefore the Jacobian will not be full rank The generalization of the condition that h(x ) 0 for the case when m = 1 is that the Jacobian matrix must 2
3 be full rank Otherwise, one of the constraints is not being taken into account, and the analysis fails We call this condition the non-degenerate constraint quailication (NDCQ) The lagrangean for the multi-constraint optimization problem is L(x 1,, x n, λ) = f(x 1,, x n ) And therefore the necessary conditions for a maximum are m λ i [h i (x 1,, x n ) c i ] i=1 = 0,, = 0 dx n = 0,, = 0 dλ 1 dλ n Maximize f(x, y, z) = xyz subject to h 1 (xyz) x 2 + y 2 = 1 and h 2 (xyz) x + z = 1 Solution: First let us form the Jacobian matrix Dh(x, y, z) = ( 2x 2y Notice that this is only singular if both x = y = 0 However, if this is the case, then our rst constraint fails to hold Therefore, the matrix is nonsingular for all points in the domain, and so we don't need to worry about the NDCQ Form the lagrangean L(x, y, z) = xyz λ 1 ( x 2 + y 2 1 ) λ 2 (x + z 1) ) The rst order conditions are x = yz 2λ 1x λ 2 = 0 y = xz 2λ 1y = 0 z = xy λ 2 = 0 λ 1 = x 2 + y 2 1 = 0 λ 2 = x + z 1 = 0 We can solve the second and third equations for λ 1 and λ 2 and plug these into the rst equation to get Multiply both sides by y λ 1 = xz 2y, λ 2 = xy yz 2 x2 z 2y xy = 0 y 2 z x 2 z xy 2 = 0 Now we want to solve the two constraints for y and z in terms of x, plug them into this equation, and get one equation in terms of x (1 x 2 )(1 x) x 2 (1 x) x(1 x 2 ) = 0 3
4 (1 x) [ (1 x 2 ) x 2 x(1 + x) ] = 0 (1 x) [ 1 3x 2 x ] = 0 { } This yeilds x = 1, , Let's analyze x = 1 rst From the second constraint we have that z = 0, and from the rst constraint we have that y = {1, 1} However, this violates the equation y 2 z x 2 z xy 2 = 0, and therefore x = 1 cannot be a solution Plugging in the other values, we get four candidate solutions x = 4343, y = ±09008, z = x = 7676, y = ±06409, z = Inequality Constraints One Constraint Consider the problem g 1 (x 1,, x n ) b 1 In this case the solution is not constrained to the curve, but merely bounded by it Solving the constrained optimization problem with inequality constraints is the same as solving them with equality constraints, but with more conditions In order to understand the new conditions, imagine the graph of the level sets which we talked about before Instead of being constrained to the function g(x), the domain is now bounded by it instead However, the boundary of the function is still the same as before Notice that there is still a point where the boundary is tangent to the highest level set on g(x) The question now is whether the boundary is binding or not binding Case 1: Binding This is the case where the unconstrained extrema lies outside of the domain In other words, the inequality constrains us from reaching the extrema of f(x) In this case, the gradient of f(x) is going to point in the steepest direction up the graph The gradient of g(x) points to the set g(x) b (since it points in the direction of increasing g(x)) Therefore, if the constraint is binding, then g(x) is pointing in the same direction as f(x), which implies that λ 0 Case 2: Not Binding This is the case where the unconstrained extrema lies inside the domain In other words, the inequality does not constrain us from reaching the extrema of f(x) Remember again that the gradient of f(x) is going to point in the steepest direction up the graph The gradient of g(x) points to the set g(x) b (since it points in the direction of increasing g(x)) This time, however, the gradient of g(x) will point away from the gradient of f(x) (since we have passed the optimum, the gradient of f(x) is now pointing in the opposite direction) Therefore, if the constraint is not binding, then g(x) is pointing in opposite direction as f(x), which implies that λ 0 As we can see, it does not matter whether the constraint binds or does not bind, the lagrangean multiplier must always be greater than or equal to 0 Therefore, a new set of conditions are λ i 0 i If the constraint binds, then that means the solution will lie somewhere on the constraint Therefore, we can replace the inequality constraint with an equality constraint: g 1 (x 1,, x n ) = b 1 4
5 This implies that g 1 (x 1,, x n ) b 1 = 0 If the constraint is not binding, then there is no use in having it in the analysis Notice that if λ = 0, then the constraint drops out just as we wish Therefore, we have a new set of conditions called the complementary slackness conditions [g 1 (x 1,, x n ) b 1 ] λ = 0 This works because if the constraint is binding, then g 1 (x 1,, x n ) b 1 = 0, and if the constraint is not binding, then λ = 0 Many Constraints Consider the problem: g 1 (x 1,, x n ) b 1,, g m (x 1,, x n ) b m In order to understand the new NDCQ, we must realize that if a constraint does not bind, we don't care if it drops out of the equation The point of the NDCQ was to ensure that binding constraints do not drop out Therefore, the NDCQ with inequality constraints is the same as the equality constraints, except for the fact that we only care about the Jacobian matrix of the binding constraints, or the Jacobian for the constraints with λ i > 0 The following rst order conditions will tell us the candidate points for extrema Homework = 0,, = 0 dx n g 1 (x 1,, x n ) b 1,, g m (x 1,, x n ) b m λ 1 0,, λ m 0 [g 1 (x 1,, x n ) b 1 ] λ 1 = 0,, [g m (x 1,, x n ) b m ] λ m = 0 1 In chapter 18 of Simon and Blume, numbers 3, 6, 7, 10, 11, and 12 5
DERIVATIVES AS MATRICES; CHAIN RULE
DERIVATIVES AS MATRICES; CHAIN RULE 1. Derivatives of Real-valued Functions Let s first consider functions f : R 2 R. Recall that if the partial derivatives of f exist at the point (x 0, y 0 ), then we
More informationSection 12.6: Directional Derivatives and the Gradient Vector
Section 26: Directional Derivatives and the Gradient Vector Recall that if f is a differentiable function of x and y and z = f(x, y), then the partial derivatives f x (x, y) and f y (x, y) give the rate
More information(a) We have x = 3 + 2t, y = 2 t, z = 6 so solving for t we get the symmetric equations. x 3 2. = 2 y, z = 6. t 2 2t + 1 = 0,
Name: Solutions to Practice Final. Consider the line r(t) = 3 + t, t, 6. (a) Find symmetric equations for this line. (b) Find the point where the first line r(t) intersects the surface z = x + y. (a) We
More informationconstraint. Let us penalize ourselves for making the constraint too big. We end up with a
Chapter 4 Constrained Optimization 4.1 Equality Constraints (Lagrangians) Suppose we have a problem: Maximize 5, (x 1, 2) 2, 2(x 2, 1) 2 subject to x 1 +4x 2 =3 If we ignore the constraint, we get the
More informationSECOND DERIVATIVE TEST FOR CONSTRAINED EXTREMA
SECOND DERIVATIVE TEST FOR CONSTRAINED EXTREMA This handout presents the second derivative test for a local extrema of a Lagrange multiplier problem. The Section 1 presents a geometric motivation for the
More informationMath 53 Worksheet Solutions- Minmax and Lagrange
Math 5 Worksheet Solutions- Minmax and Lagrange. Find the local maximum and minimum values as well as the saddle point(s) of the function f(x, y) = e y (y x ). Solution. First we calculate the partial
More informationProt Maximization and Cost Minimization
Simon Fraser University Prof. Karaivanov Department of Economics Econ 0 COST MINIMIZATION Prot Maximization and Cost Minimization Remember that the rm's problem is maximizing prots by choosing the optimal
More informationSolutions for Review Problems
olutions for Review Problems 1. Let be the triangle with vertices A (,, ), B (4,, 1) and C (,, 1). (a) Find the cosine of the angle BAC at vertex A. (b) Find the area of the triangle ABC. (c) Find a vector
More informationWalrasian Demand. u(x) where B(p, w) = {x R n + : p x w}.
Walrasian Demand Econ 2100 Fall 2015 Lecture 5, September 16 Outline 1 Walrasian Demand 2 Properties of Walrasian Demand 3 An Optimization Recipe 4 First and Second Order Conditions Definition Walrasian
More informationLinear and quadratic Taylor polynomials for functions of several variables.
ams/econ 11b supplementary notes ucsc Linear quadratic Taylor polynomials for functions of several variables. c 010, Yonatan Katznelson Finding the extreme (minimum or maximum) values of a function, is
More information( 1)2 + 2 2 + 2 2 = 9 = 3 We would like to make the length 6. The only vectors in the same direction as v are those
1.(6pts) Which of the following vectors has the same direction as v 1,, but has length 6? (a), 4, 4 (b),, (c) 4,, 4 (d), 4, 4 (e) 0, 6, 0 The length of v is given by ( 1) + + 9 3 We would like to make
More information3.1 Solving Systems Using Tables and Graphs
Algebra 2 Chapter 3 3.1 Solve Systems Using Tables & Graphs 3.1 Solving Systems Using Tables and Graphs A solution to a system of linear equations is an that makes all of the equations. To solve a system
More informationNonlinear Programming Methods.S2 Quadratic Programming
Nonlinear Programming Methods.S2 Quadratic Programming Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard A linearly constrained optimization problem with a quadratic objective
More informationIf Σ is an oriented surface bounded by a curve C, then the orientation of Σ induces an orientation for C, based on the Right-Hand-Rule.
Oriented Surfaces and Flux Integrals Let be a surface that has a tangent plane at each of its nonboundary points. At such a point on the surface two unit normal vectors exist, and they have opposite directions.
More informationFINAL EXAM SOLUTIONS Math 21a, Spring 03
INAL EXAM SOLUIONS Math 21a, Spring 3 Name: Start by printing your name in the above box and check your section in the box to the left. MW1 Ken Chung MW1 Weiyang Qiu MW11 Oliver Knill h1 Mark Lucianovic
More informationMicroeconomic Theory: Basic Math Concepts
Microeconomic Theory: Basic Math Concepts Matt Van Essen University of Alabama Van Essen (U of A) Basic Math Concepts 1 / 66 Basic Math Concepts In this lecture we will review some basic mathematical concepts
More informationScalar Valued Functions of Several Variables; the Gradient Vector
Scalar Valued Functions of Several Variables; the Gradient Vector Scalar Valued Functions vector valued function of n variables: Let us consider a scalar (i.e., numerical, rather than y = φ(x = φ(x 1,
More informationConstrained optimization.
ams/econ 11b supplementary notes ucsc Constrained optimization. c 2010, Yonatan Katznelson 1. Constraints In many of the optimization problems that arise in economics, there are restrictions on the values
More informationH.Calculating Normal Vectors
Appendix H H.Calculating Normal Vectors This appendix describes how to calculate normal vectors for surfaces. You need to define normals to use the OpenGL lighting facility, which is described in Chapter
More informationEconomics 121b: Intermediate Microeconomics Problem Set 2 1/20/10
Dirk Bergemann Department of Economics Yale University s by Olga Timoshenko Economics 121b: Intermediate Microeconomics Problem Set 2 1/20/10 This problem set is due on Wednesday, 1/27/10. Preliminary
More informationSOLUTIONS. f x = 6x 2 6xy 24x, f y = 3x 2 6y. To find the critical points, we solve
SOLUTIONS Problem. Find the critical points of the function f(x, y = 2x 3 3x 2 y 2x 2 3y 2 and determine their type i.e. local min/local max/saddle point. Are there any global min/max? Partial derivatives
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More information1 3 4 = 8i + 20j 13k. x + w. y + w
) Find the point of intersection of the lines x = t +, y = 3t + 4, z = 4t + 5, and x = 6s + 3, y = 5s +, z = 4s + 9, and then find the plane containing these two lines. Solution. Solve the system of equations
More informationPractice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationSolutions to Homework 5
Solutions to Homework 5 1. Let z = f(x, y) be a twice continously differentiable function of x and y. Let x = r cos θ and y = r sin θ be the equations which transform polar coordinates into rectangular
More informationTo give it a definition, an implicit function of x and y is simply any relationship that takes the form:
2 Implicit function theorems and applications 21 Implicit functions The implicit function theorem is one of the most useful single tools you ll meet this year After a while, it will be second nature to
More information1.5. Factorisation. Introduction. Prerequisites. Learning Outcomes. Learning Style
Factorisation 1.5 Introduction In Block 4 we showed the way in which brackets were removed from algebraic expressions. Factorisation, which can be considered as the reverse of this process, is dealt with
More informationIn this section, we will consider techniques for solving problems of this type.
Constrained optimisation roblems in economics typically involve maximising some quantity, such as utility or profit, subject to a constraint for example income. We shall therefore need techniques for solving
More informationIncreasing for all. Convex for all. ( ) Increasing for all (remember that the log function is only defined for ). ( ) Concave for all.
1. Differentiation The first derivative of a function measures by how much changes in reaction to an infinitesimal shift in its argument. The largest the derivative (in absolute value), the faster is evolving.
More informationCost Minimization and the Cost Function
Cost Minimization and the Cost Function Juan Manuel Puerta October 5, 2009 So far we focused on profit maximization, we could look at a different problem, that is the cost minimization problem. This is
More informationVector Calculus Solutions to Sample Final Examination #1
Vector alculus s to Sample Final Examination #1 1. Let f(x, y) e xy sin(x + y). (a) In what direction, starting at (,π/), is f changing the fastest? (b) In what directions starting at (,π/) is f changing
More informationA QUICK GUIDE TO THE FORMULAS OF MULTIVARIABLE CALCULUS
A QUIK GUIDE TO THE FOMULAS OF MULTIVAIABLE ALULUS ontents 1. Analytic Geometry 2 1.1. Definition of a Vector 2 1.2. Scalar Product 2 1.3. Properties of the Scalar Product 2 1.4. Length and Unit Vectors
More informationThis makes sense. t 2 1 + 1/t 2 dt = 1. t t 2 + 1dt = 2 du = 1 3 u3/2 u=5
1. (Line integrals Using parametrization. Two types and the flux integral) Formulas: ds = x (t) dt, d x = x (t)dt and d x = T ds since T = x (t)/ x (t). Another one is Nds = T ds ẑ = (dx, dy) ẑ = (dy,
More informationLinear Programming Notes V Problem Transformations
Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material
More informationMath 241, Exam 1 Information.
Math 241, Exam 1 Information. 9/24/12, LC 310, 11:15-12:05. Exam 1 will be based on: Sections 12.1-12.5, 14.1-14.3. The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/241fa12/241.html)
More informationDetermine If An Equation Represents a Function
Question : What is a linear function? The term linear function consists of two parts: linear and function. To understand what these terms mean together, we must first understand what a function is. The
More informationPolynomial and Rational Functions
Polynomial and Rational Functions Quadratic Functions Overview of Objectives, students should be able to: 1. Recognize the characteristics of parabolas. 2. Find the intercepts a. x intercepts by solving
More informationDate: April 12, 2001. Contents
2 Lagrange Multipliers Date: April 12, 2001 Contents 2.1. Introduction to Lagrange Multipliers......... p. 2 2.2. Enhanced Fritz John Optimality Conditions...... p. 12 2.3. Informative Lagrange Multipliers...........
More information15 Kuhn -Tucker conditions
5 Kuhn -Tucker conditions Consider a version of the consumer problem in which quasilinear utility x 2 + 4 x 2 is maximised subject to x +x 2 =. Mechanically applying the Lagrange multiplier/common slopes
More information6.4 Logarithmic Equations and Inequalities
6.4 Logarithmic Equations and Inequalities 459 6.4 Logarithmic Equations and Inequalities In Section 6.3 we solved equations and inequalities involving exponential functions using one of two basic strategies.
More informationcorrect-choice plot f(x) and draw an approximate tangent line at x = a and use geometry to estimate its slope comment The choices were:
Topic 1 2.1 mode MultipleSelection text How can we approximate the slope of the tangent line to f(x) at a point x = a? This is a Multiple selection question, so you need to check all of the answers that
More informationReview Sheet for Test 1
Review Sheet for Test 1 Math 261-00 2 6 2004 These problems are provided to help you study. The presence of a problem on this handout does not imply that there will be a similar problem on the test. And
More information1.7 Graphs of Functions
64 Relations and Functions 1.7 Graphs of Functions In Section 1.4 we defined a function as a special type of relation; one in which each x-coordinate was matched with only one y-coordinate. We spent most
More informationIntroduction to Algebraic Geometry. Bézout s Theorem and Inflection Points
Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a
More informationMATH 425, PRACTICE FINAL EXAM SOLUTIONS.
MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator
More informationEconomics 2020a / HBS 4010 / HKS API-111 FALL 2010 Solutions to Practice Problems for Lectures 1 to 4
Economics 00a / HBS 4010 / HKS API-111 FALL 010 Solutions to Practice Problems for Lectures 1 to 4 1.1. Quantity Discounts and the Budget Constraint (a) The only distinction between the budget line with
More information2.2 Creaseness operator
2.2. Creaseness operator 31 2.2 Creaseness operator Antonio López, a member of our group, has studied for his PhD dissertation the differential operators described in this section [72]. He has compared
More informationSection 2.4: Equations of Lines and Planes
Section.4: Equations of Lines and Planes An equation of three variable F (x, y, z) 0 is called an equation of a surface S if For instance, (x 1, y 1, z 1 ) S if and only if F (x 1, y 1, z 1 ) 0. x + y
More informationStudy Guide 2 Solutions MATH 111
Study Guide 2 Solutions MATH 111 Having read through the sample test, I wanted to warn everyone, that I might consider asking questions involving inequalities, the absolute value function (as in the suggested
More informationSolutions to Homework 10
Solutions to Homework 1 Section 7., exercise # 1 (b,d): (b) Compute the value of R f dv, where f(x, y) = y/x and R = [1, 3] [, 4]. Solution: Since f is continuous over R, f is integrable over R. Let x
More informationSOLUTIONS TO HOMEWORK ASSIGNMENT #4, MATH 253
SOLUTIONS TO HOMEWORK ASSIGNMENT #4, MATH 253 1. Prove that the following differential equations are satisfied by the given functions: (a) 2 u + 2 u 2 y + 2 u 2 z =0,whereu 2 =(x2 + y 2 + z 2 ) 1/2. (b)
More informationME 115(b): Solution to Homework #1
ME 115(b): Solution to Homework #1 Solution to Problem #1: To construct the hybrid Jacobian for a manipulator, you could either construct the body Jacobian, JST b, and then use the body-to-hybrid velocity
More information1 Solving LPs: The Simplex Algorithm of George Dantzig
Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.
More informationChapter 7 - Roots, Radicals, and Complex Numbers
Math 233 - Spring 2009 Chapter 7 - Roots, Radicals, and Complex Numbers 7.1 Roots and Radicals 7.1.1 Notation and Terminology In the expression x the is called the radical sign. The expression under the
More informationSolutions to Practice Problems for Test 4
olutions to Practice Problems for Test 4 1. Let be the line segmentfrom the point (, 1, 1) to the point (,, 3). Evaluate the line integral y ds. Answer: First, we parametrize the line segment from (, 1,
More informationIEOR 4404 Homework #2 Intro OR: Deterministic Models February 14, 2011 Prof. Jay Sethuraman Page 1 of 5. Homework #2
IEOR 4404 Homework # Intro OR: Deterministic Models February 14, 011 Prof. Jay Sethuraman Page 1 of 5 Homework #.1 (a) What is the optimal solution of this problem? Let us consider that x 1, x and x 3
More informationwww.mathsbox.org.uk ab = c a If the coefficients a,b and c are real then either α and β are real or α and β are complex conjugates
Further Pure Summary Notes. Roots of Quadratic Equations For a quadratic equation ax + bx + c = 0 with roots α and β Sum of the roots Product of roots a + b = b a ab = c a If the coefficients a,b and c
More informationLimits and Continuity
Math 20C Multivariable Calculus Lecture Limits and Continuity Slide Review of Limit. Side limits and squeeze theorem. Continuous functions of 2,3 variables. Review: Limits Slide 2 Definition Given a function
More information8 Polynomials Worksheet
8 Polynomials Worksheet Concepts: Quadratic Functions The Definition of a Quadratic Function Graphs of Quadratic Functions - Parabolas Vertex Absolute Maximum or Absolute Minimum Transforming the Graph
More informationClick on the links below to jump directly to the relevant section
Click on the links below to jump directly to the relevant section What is algebra? Operations with algebraic terms Mathematical properties of real numbers Order of operations What is Algebra? Algebra is
More informationRepresentation of functions as power series
Representation of functions as power series Dr. Philippe B. Laval Kennesaw State University November 9, 008 Abstract This document is a summary of the theory and techniques used to represent functions
More informationSolving DEs by Separation of Variables.
Solving DEs by Separation of Variables. Introduction and procedure Separation of variables allows us to solve differential equations of the form The steps to solving such DEs are as follows: dx = gx).
More informationProcedure for Graphing Polynomial Functions
Procedure for Graphing Polynomial Functions P(x) = a n x n + a n-1 x n-1 + + a 1 x + a 0 To graph P(x): As an example, we will examine the following polynomial function: P(x) = 2x 3 3x 2 23x + 12 1. Determine
More informationObjectives. Materials
Activity 4 Objectives Understand what a slope field represents in terms of Create a slope field for a given differential equation Materials TI-84 Plus / TI-83 Plus Graph paper Introduction One of the ways
More information42 CHAPTER 1. VECTORS AND THE GEOMETRY OF SPACE. Figure 1.18: Parabola y = 2x 2. 1.6.1 Brief review of Conic Sections
2 CHAPTER 1. VECTORS AND THE GEOMETRY OF SPACE Figure 1.18: Parabola y = 2 1.6 Quadric Surfaces 1.6.1 Brief review of Conic Sections You may need to review conic sections for this to make more sense. You
More informationAlgebra I Notes Relations and Functions Unit 03a
OBJECTIVES: F.IF.A.1 Understand the concept of a function and use function notation. Understand that a function from one set (called the domain) to another set (called the range) assigns to each element
More informationPractical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
More informationMath 120 Final Exam Practice Problems, Form: A
Math 120 Final Exam Practice Problems, Form: A Name: While every attempt was made to be complete in the types of problems given below, we make no guarantees about the completeness of the problems. Specifically,
More informationDifferentiation of vectors
Chapter 4 Differentiation of vectors 4.1 Vector-valued functions In the previous chapters we have considered real functions of several (usually two) variables f : D R, where D is a subset of R n, where
More informationMaximizing volume given a surface area constraint
Maximizing volume given a surface area constraint Math 8 Department of Mathematics Dartmouth College Maximizing volume given a surface area constraint p.1/9 Maximizing wih a constraint We wish to solve
More informationNumerisches Rechnen. (für Informatiker) M. Grepl J. Berger & J.T. Frings. Institut für Geometrie und Praktische Mathematik RWTH Aachen
(für Informatiker) M. Grepl J. Berger & J.T. Frings Institut für Geometrie und Praktische Mathematik RWTH Aachen Wintersemester 2010/11 Problem Statement Unconstrained Optimality Conditions Constrained
More informationConstrained Optimization: The Method of Lagrange Multipliers:
Constrained Optimization: The Method of Lagrange Multipliers: Suppose the equation p(x,) x 60x 7 00 models profit when x represents the number of handmade chairs and is the number of handmade rockers produced
More informationLinear Programming Problems
Linear Programming Problems Linear programming problems come up in many applications. In a linear programming problem, we have a function, called the objective function, which depends linearly on a number
More informationElements of a graph. Click on the links below to jump directly to the relevant section
Click on the links below to jump directly to the relevant section Elements of a graph Linear equations and their graphs What is slope? Slope and y-intercept in the equation of a line Comparing lines on
More informationConsumer Theory. The consumer s problem
Consumer Theory The consumer s problem 1 The Marginal Rate of Substitution (MRS) We define the MRS(x,y) as the absolute value of the slope of the line tangent to the indifference curve at point point (x,y).
More informationTOPIC 4: DERIVATIVES
TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the
More informationMath 265 (Butler) Practice Midterm II B (Solutions)
Math 265 (Butler) Practice Midterm II B (Solutions) 1. Find (x 0, y 0 ) so that the plane tangent to the surface z f(x, y) x 2 + 3xy y 2 at ( x 0, y 0, f(x 0, y 0 ) ) is parallel to the plane 16x 2y 2z
More informationChapter 4 Online Appendix: The Mathematics of Utility Functions
Chapter 4 Online Appendix: The Mathematics of Utility Functions We saw in the text that utility functions and indifference curves are different ways to represent a consumer s preferences. Calculus can
More informationSurface Normals and Tangent Planes
Surface Normals and Tangent Planes Normal and Tangent Planes to Level Surfaces Because the equation of a plane requires a point and a normal vector to the plane, nding the equation of a tangent plane to
More informationLinear Equations. Find the domain and the range of the following set. {(4,5), (7,8), (-1,3), (3,3), (2,-3)}
Linear Equations Domain and Range Domain refers to the set of possible values of the x-component of a point in the form (x,y). Range refers to the set of possible values of the y-component of a point in
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty
More informationSensitivity Analysis 3.1 AN EXAMPLE FOR ANALYSIS
Sensitivity Analysis 3 We have already been introduced to sensitivity analysis in Chapter via the geometry of a simple example. We saw that the values of the decision variables and those of the slack and
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationx 2 + y 2 = 1 y 1 = x 2 + 2x y = x 2 + 2x + 1
Implicit Functions Defining Implicit Functions Up until now in this course, we have only talked about functions, which assign to every real number x in their domain exactly one real number f(x). The graphs
More informationVector Notation: AB represents the vector from point A to point B on a graph. The vector can be computed by B A.
1 Linear Transformations Prepared by: Robin Michelle King A transformation of an object is a change in position or dimension (or both) of the object. The resulting object after the transformation is called
More informationAim. Decimal Search. An Excel 'macro' was used to do the calculations. A copy of the script can be found in Appendix A.
Aim The aim of this investigation is to use and compare three different methods of finding specific solutions to polynomials that cannot be solved algebraically. The methods that will be considered are;
More informationChapter 6. Linear Programming: The Simplex Method. Introduction to the Big M Method. Section 4 Maximization and Minimization with Problem Constraints
Chapter 6 Linear Programming: The Simplex Method Introduction to the Big M Method In this section, we will present a generalized version of the simplex method that t will solve both maximization i and
More informationFocus on minimizing costs EOQ Linear Programming. Two types of inventory costs (IC): Order/Setup Costs (OCs), and Carrying Costs (CCs) IC = OC + CC
Focus on minimizing costs EOQ Linear Programming Economic Order Quantity (EOQ) model determines: Optimal amount of inventory to produce/purchase at given time Discussion applicable to production runs and
More information1 2 3 1 1 2 x = + x 2 + x 4 1 0 1
(d) If the vector b is the sum of the four columns of A, write down the complete solution to Ax = b. 1 2 3 1 1 2 x = + x 2 + x 4 1 0 0 1 0 1 2. (11 points) This problem finds the curve y = C + D 2 t which
More informationDifferentiating under an integral sign
CALIFORNIA INSTITUTE OF TECHNOLOGY Ma 2b KC Border Introduction to Probability and Statistics February 213 Differentiating under an integral sign In the derivation of Maximum Likelihood Estimators, or
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More informationLinear Programming. March 14, 2014
Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1
More informationRolle s Theorem. q( x) = 1
Lecture 1 :The Mean Value Theorem We know that constant functions have derivative zero. Is it possible for a more complicated function to have derivative zero? In this section we will answer this question
More informationLinear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc.
1. Introduction Linear Programming for Optimization Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc. 1.1 Definition Linear programming is the name of a branch of applied mathematics that
More informationThe Envelope Theorem 1
John Nachbar Washington University April 2, 2015 1 Introduction. The Envelope Theorem 1 The Envelope theorem is a corollary of the Karush-Kuhn-Tucker theorem (KKT) that characterizes changes in the value
More information1 Lecture: Integration of rational functions by decomposition
Lecture: Integration of rational functions by decomposition into partial fractions Recognize and integrate basic rational functions, except when the denominator is a power of an irreducible quadratic.
More informationExam 1 Sample Question SOLUTIONS. y = 2x
Exam Sample Question SOLUTIONS. Eliminate the parameter to find a Cartesian equation for the curve: x e t, y e t. SOLUTION: You might look at the coordinates and notice that If you don t see it, we can
More informationLeast-Squares Intersection of Lines
Least-Squares Intersection of Lines Johannes Traa - UIUC 2013 This write-up derives the least-squares solution for the intersection of lines. In the general case, a set of lines will not intersect at a
More informationSolutions - Homework sections 17.7-17.9
olutions - Homework sections 7.7-7.9 7.7 6. valuate xy d, where is the triangle with vertices (,, ), (,, ), and (,, ). The three points - and therefore the triangle between them - are on the plane x +
More information