ConcepTest Section 15.3 Question 1 For problems 1-2, use Figure 15.2. The grid lines are one unit apart. Find the maximum and minimum values of f on g.

Slides:



Advertisements
Similar presentations
10 Trigonometry (1) Contents 10.1 Basic Terminology of Trigonometry
Advertisements

Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Linear Inequalities and Linear Programming Chapter 5 Dr.Hayk Melikyan/ Department of Mathematics and CS/ Linear Programming in two dimensions:
Quadratic Functions.
APPLICATIONS OF DIFFERENTIATION
§ 8.3 Quadratic Functions and Their Graphs.
§ 8.3 Quadratic Functions and Their Graphs. Graphing Quadratic Functions Blitzer, Intermediate Algebra, 5e – Slide #2 Section 8.3 The graph of any quadratic.
Lesson 7.6, page 767 Linear Programming
Linear Programming?!?! Sec Linear Programming In management science, it is often required to maximize or minimize a linear function called an objective.
1 © 2010 Pearson Education, Inc. All rights reserved © 2010 Pearson Education, Inc. All rights reserved Chapter 8 Systems of Equations and Inequalities.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Chapter 6 Linear Programming: The Simplex Method
Linear Programming. A linear programming problem is made up of an objective function and a system of constraints. The objective function is an algebraic.
Topic 1: Graphs of Polynomial Functions
Quadrant II (x 0) Quadrant I (x > 0, y>0) ( -5, 3) x-axis Origin ( 0,0 ) Quadrant IV (x>0, y
X y (x,y) x - coordinate y - coordinate. How are coordinates helpful?
Origin: The point of intersection of the x and y axes.
15 PARTIAL DERIVATIVES.
Maximum and Minimum Values (Section 3.1)
1 The Unit Circle The set of points at a distance 1 from the origin is a circle of radius 1. The equation of this circle is x 2 + y 2 = 1 The unit circle.
Systems of Equations & Inequalities
Linear Programming Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Linear programming is a strategy for finding the.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved. Quadratic Equations, Quadratic Functions, and Complex Numbers 9.
1 © 2010 Pearson Education, Inc. All rights reserved © 2010 Pearson Education, Inc. All rights reserved Chapter 8 Systems of Equations and Inequalities.
Linear Systems of Equations
Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities.
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall. Chapter 10 Graphing Equations and Inequalities.
Polynomial Functions Topic 2: Equations of Polynomial Functions.
Slide Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 15.
Topic III The Simplex Method Setting up the Method Tabular Form Chapter(s): 4.
Chapter 6 Linear Programming: The Simplex Method Section R Review.
Graphing Linear Inequalities in Two Variables Chapter 4 – Section 1.
Systems of Inequalities in Two Variables Sec. 7.5a.
1.1 EXPLORING STATISTICAL QUESTIONS Unit 1 Data Displays and Number Systems.
Graphs of Quadratic Functions
Equations of Circles (x – a)2 + (y – b)2 = r2
Linear Programming Problem. Definition A linear programming problem is the problem of optimizing (maximizing or minimizing) a linear function (a function.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
ConcepTest • Section 2.3 • Question 1
The Rectangular Coordinate System and Paired Data Section 8.3.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 6.3 The student will be able to formulate the dual problem. The student.
3.4 Applications of Minima and Maxima 1 Example: For a short time interval, the current i (in amperes) in a circuit containing an inductor is given by.
3.1 Reading Graphs and the Rectangular Coordinate System.
Slide 1 Copyright © 2015, 2011, 2008 Pearson Education, Inc. The Rectangular Coordinate System and Paired Data Section8.3.
Functions of Several Variables Copyright © Cengage Learning. All rights reserved.
ConcepTest Section 14.1 Question 1 Problems 1-2 concern the contour diagram for a function f (x, y) in Figure At the point Q, which of the following.
Copyright © Cengage Learning. All rights reserved. 14 Partial Derivatives.
Functions of Several Variables 13 Copyright © Cengage Learning. All rights reserved.
Section Lagrange Multipliers.
Section 15.3 Constrained Optimization: Lagrange Multipliers.
The Rectangular Coordinate System and Paired Data Section 3.1.
Inequality Constraints Lecture 7. Inequality Contraints (I) n A Review of Lagrange Multipliers –As we discussed last time, the first order necessary conditions.
Sullivan Algebra and Trigonometry: Section 12.9 Objectives of this Section Set Up a Linear Programming Problem Solve a Linear Programming Problem.
Copyright © Cengage Learning. All rights reserved. Trigonometric Functions: Unit Circle Approach.
1 Objectives ► The Unit Circle ► Terminal Points on the Unit Circle ► The Reference Number.
Multivariate Optimization Problems
Digital Lesson Linear Programming.
Linear Programming: The Graphical Method
Digital Lesson Linear Programming.
Graphs and the Derivative
prepared by Imran Ismail
Linear Programming in Two Dimensions
Algebra II Honors/Gifted
Graphs and the Derivative
13 Functions of Several Variables
Warm Up Solve for x:
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Presentation transcript:

ConcepTest Section 15.3 Question 1 For problems 1-2, use Figure The grid lines are one unit apart. Find the maximum and minimum values of f on g = c. At which points do they occur?

ConcepTest Section 15.3 Answer 1 The maximum is f = 4 and occurs at (0, 4). The minimum is f = 2 and occurs at about (4, 2). ANSWER

ConcepTest Section 15.3 Question 2 For problems 1-2, use Figure The grid lines are one unit apart. Find the maximum and minimum values of f on the triangular region below g = c in the first quadrant.

ConcepTest Section 15.3 Answer 2 The maximum is f = 4 and occurs at (0, 4). The minimum is f = 0 and occurs at the origin. ANSWER

ConcepTest Section 15.3 Question 3 Problems 3-4 concern the following: (a) Maximize x 2 y 2 subject to x 2 + y 2 = 4. (b) Maximize x + y subject to x 2 + y 2 = 4. (c) Minimize x 2 + y 2 subject to x 2 y 2 = 4. (d) Maximize x 2 y 2 subject to x + y = 4. Which one of (a)–(d) does not have its solution at the same point in the first quadrant as the others?

ConcepTest Section 15.3 Answer 3 ANSWER The answer is (d). (a) We solve2xy 2 = 2xλ 2x 2 y = 2yλ x 2 + y 2 = 4, giving x 2 = y 2, so 2x 2 = 4, so (since we are working in the first quadrant) x = y = (b) We solve1 = 2xλ 1 = 2yλ x 2 + y 2 = 4, giving x = y, so 2x 2 = 4, so (since we are working in the first quadrant) x = y =

ConcepTest Section 15.3 Answer 3 (continued) ANSWER (continued) (c) We solve2x = 2xy 2 λ 2y = 2x 2 yλ x 2 y 2 = 4, giving x 2 = y 2, so (x 2 ) 2 = 4, so (since we are working in the first quadrant) x = y = (d) We solve2xy 2 = λ 2x 2 y = λ x + y = 4. Dividing the first two equations gives x = y, so (since we are working in the first quadrant) x = y = 2. Thus (a), (b), and (c) have their solution at x = y = and (d) has its solution at a different point, namely x = y = 2.

ConcepTest Section 15.3 Question 4 Problems 3-4 concern the following: (a) Maximize x 2 y 2 subject to x 2 + y 2 = 4. (b) Maximize x + y subject to x 2 + y 2 = 4. (c) Minimize x 2 + y 2 subject to x 2 y 2 = 4. (d) Maximize x 2 y 2 subject to x + y = 4. Which two of (a)–(d) have the same extreme value of the objective function in the first quadrant?

ConcepTest Section 15.3 Answer 4 ANSWER

ConcepTest Section 15.3 Question 5 Find the maximum of the production function f (x, y) = xy in the first quadrant subject to each of the three budget constraints. (a) x: I < II < III(f) y: I < II < III (b) x: III < II < I(g) y: III < II < I (c) x: II < III < I(h) y: II < III < I (d) x: II < I < III(i) y: II < I < III (e) x: III < I < II(j) y: III < I < II Arrange the x- and y-coordinates of the optimal point in increasing order. Pick one of (a)–(e) and one of (f)–(j). I. x + y = 12 II. 2x + 5y = 12 III. 3x + y/2 = 12

ConcepTest Section 15.3 Answer 5 ANSWER For (I), we have y = λ x = λ x + y = 12, so x = y, and the solution is x = 6, y = 6. For (II),we havey = 2λ x = 5λ 2x + 5y = 12, so 2x = 5y, and the solution is x = 3, y = 1.2. For (III), we have y = 3λ x = λ/2 3x + y/2 = 12, so 3x = y/2, and the solution is x = 2, y = 12. Thus, for x: III < II < I, for y: II < I < III. The answer is (b) and (i).

ConcepTest Section 15.3 Question 6 The point P is a maximum or minimum of the function f subject to the constraint g (x, y) = x + y = c, with x, y ≥ 0. For each of the cases, does P give a maximum or a minimum of f? What is the sign of λ? If P gives a maximum, where does the minimum of f occur? If P gives a minimum, where does the maximum of f occur?

ConcepTest Section 15.3 Answer 6 (a) The point P gives a minimum; the maximum is at one of the end points of the line segment (either the x- or the y-intercept). The value of λ is negative, since f decreases in the direction in which g increases. (b) The point P gives a maximum; the minimum is at the x- or y-intercept. The value of λ is positive, since f and g increase in the same direction. ANSWER

ConcepTest Section 15.3 Question 7 Figure 15.5 shows the optimal point (marked with a dot) in three optimization problems with the same constraint. Arrange the corresponding values of λ in increasing order. (Assume λ is positive). (a) I < II < III (b) II < III < I (c) III < II < I (d) I < III < II

ConcepTest Section 15.3 Answer 7 Since λ is the additional f that is obtained by relaxing the constraint by 1 unit, λ is larger if the level curves of f are close together near the optimal point. The answer is I < II < III, so (a). ANSWER