Connect 1-semester Access Card For Numerical Methods For Engineers
7th Edition
ISBN: 9781259168772
Author: Chapra, Steven, Canale, Raymond
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 13, Problem 12P
Develop a program using a programming or macro language to implement the golden-section search algorithm. Design the program so that it is expressly designed to locate a maximum. The subroutine should have the following features:
• Iterate until the relative error falls below a stopping criterion or exceeds a maximum number of iterations.
• Return both the optimal x and
• Minimize the number of function evaluations.
Test your program with the same problem as Example 13.1.
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
Use the simplex algorithm to solve the following linear optimisation problem: maximisef(x1,x2,x3)=3x1+x2+2x3 subjectto:
3x1 +2x2 +x3 ≤8
x1 +2x2 +2x3 ≤4,
x1,x2,x3 ≥0.
You must address each of the 5 steps of the algorithm as presented in the course notes and videos in your answer.
Suppose we seek to minimizef(x)= 1/2 (x^T)Hx+ (c^T)x + 13
where
H = 10 −9 −9 10
and c = 4 −15
Implement the steepest descent algorithm on this problem, using the starting point x0 = (11,0 )^T.
Determine the optimal value for the minimization of the following
Chapter 13 Solutions
Connect 1-semester Access Card For Numerical Methods For Engineers
Ch. 13 - 13.1 Given the formula
(a) Determine the...Ch. 13 - 13.2 Given
(a) Plot the function.
(b) Use...Ch. 13 - Prob. 3PCh. 13 - Repeat Prob. 13.3, except use parabolic...Ch. 13 - 13.5 Repeat Prob. 13.3 but use Newton’s method....Ch. 13 - Employ the following methods to find the maximum...Ch. 13 - 13.7 Consider the following function:
Use...Ch. 13 - Employ the following methods to find the maximum...Ch. 13 - 13.9 Consider the following function:
Perform...Ch. 13 - Consider the following function:...
Ch. 13 - 13.11 Determine the minimum of the function from...Ch. 13 - Develop a program using a programming or macro...Ch. 13 - Develop a program as described in Prob. 13.12, but...Ch. 13 - 13.14 Develop a program using a programming or...Ch. 13 - 13.15 Develop a program using a programming or...Ch. 13 - Pressure measurements are taken at certain points...Ch. 13 - 13.17 The trajectory of a ball can be computed...Ch. 13 - 13.18 The deflection of a uniform beam subject to...Ch. 13 - An object with a mass of 100 kg is projected...Ch. 13 - The normal distribution is a bell-shaped curve...Ch. 13 - An object can be projected upward at a specified...Ch. 13 - Use the golden-section search to determine the...
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.Similar questions
- An advertising firm has D dollars to spend on reachingcustomers in T separate markets. Market t consists of ktpeople. If x dollars are spent on advertising in market t, theprobability that a given person in market t will be reachedis pt(x). Each person in market t who is reached will buy ctunits of the product. A person who is not reached will notbuy any of the product. Formulate a dynamic programmingrecursion that could be used to maximize the expectednumber of units sold in T markets.arrow_forwardUse the Runge-Kutta Fehlberg Algorithm to approximate the solution to the following initial-value problems. This is a numerical analysis problemarrow_forwardfind the mximum possible order of S5arrow_forward
- construct the initial simplex tableau for the linear programming as follows: minimize z = 4x1 + 2x2 x1- x2 ≤ 150 -x1+ x2 ≤ 150 x1 +x2 ≥ 100 x1 +x2 ≤ 350 x1 + x2 ≥ 200 x1,x2 ≥ 0arrow_forwardSolve the following linear optimization model using the Simplex Algorithm:Maximize z(x1, x2) = 3x1 + 2x2Subject to2x1 + 2x2 ≤ 82x1 + 1x2 ≤ 6x1, x2 ≥ 0arrow_forwardPlease do not give solution in image format thanku QUESTION: Find the optimal integer solution of the integer programming problem given below with the 'cut plane algorithm' and draw the tree diagram. Max.z = 3x1 + 5x2 şkg 3x1 + 4x2 ≤ 25 x1 + 4x2 ≤ 16 x1 + x2 ≤ 8 x1 , x2 ≥ 0 and integerarrow_forward
- Consider the equality-constrained linear program: minimize cT x subject to Ax = b. Show that if A has full column rank and b ∈ range(A), then this problem always has a unique bounded solution, regardless of the definition of c. Do Lagrange multipliers exist? If they exist, are they unique?arrow_forward22) Determine using the Simplex algorithm the optimal solution to the following linear programming problem:arrow_forwardFind the optimum of f(x) = 2.2x – 1.7x2 + x3 – 0.25x4 Perform: (Round-off all computed values to 4 decimal places.)a) (2 iterations) Golden-Section Search using XL = –2.4 and XU = 4.5 For each iteration, show the following: d, X1, X2, decision rule, ea, and the next XL andXU Are you approaching a local or global optimum? ____________ Are you approaching a minimum or maximum optimum? __________arrow_forward
- Consider the LP model and its corresponding graph below. Maximize z = 5x + 4ySubject to:3x + 2y <= 12x + 2y >= 8x >= 0y >= 0 From the given graph, what are the corner points of the feasible region? What are the values of x and y for the optimal solution? What is the maximum value of z?arrow_forwardDraw a network showing the quantities obtained in the final iteration and the optimal value of z.arrow_forwardFind the maximum value of the function z = 8x-2y with the restrictions as shown by the feasible region abovearrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Advanced Engineering MathematicsAdvanced MathISBN:9780470458365Author:Erwin KreyszigPublisher:Wiley, John & Sons, Incorporated
Numerical Methods for EngineersAdvanced MathISBN:9780073397924Author:Steven C. Chapra Dr., Raymond P. CanalePublisher:McGraw-Hill Education
Introductory Mathematics for Engineering Applicat...Advanced MathISBN:9781118141809Author:Nathan KlingbeilPublisher:WILEY
Mathematics For Machine TechnologyAdvanced MathISBN:9781337798310Author:Peterson, John.Publisher:Cengage Learning,
Advanced Engineering Mathematics
Advanced Math
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:9780073397924
Author:Steven C. Chapra Dr., Raymond P. Canale
Publisher:McGraw-Hill Education
Introductory Mathematics for Engineering Applicat...
Advanced Math
ISBN:9781118141809
Author:Nathan Klingbeil
Publisher:WILEY
Mathematics For Machine Technology
Advanced Math
ISBN:9781337798310
Author:Peterson, John.
Publisher:Cengage Learning,
12. Searching and Sorting; Author: MIT OpenCourseWare;https://www.youtube.com/watch?v=6LOwPhPDwVc;License: Standard YouTube License, CC-BY
Algorithms and Data Structures - Full Course for Beginners from Treehouse; Author: freeCodeCamp.org;https://www.youtube.com/watch?v=8hly31xKli0;License: Standard Youtube License