Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
bartleby

Concept explainers

Expert Solution & Answer
Book Icon
Chapter 11, Problem 5RP

Explanation of Solution

Finding an optimal solution using Golden Section Search:

The given NLP is as follows:

Max 3xx2Such that,0x5

Here, x variable lies between 0 and 5.

So, a=0, b=5.

Now,

r=51/212   =0.618

Determine the new lower and upper limits as follows,

x1=br(ba)    =1.9098x2=a+r(ba)    =3.0902

Now, f is unimodal function of xwith f(x)=3xx2.

So, for these new limits, we can obtain the function,

f(x1)=3×1.9098(1.9098)2          =2.0820f(x2)=3×3.0901(3.0901)2          =.027864

Since, f(x1)>f(x2), the new interval of uncertainty will be,

I1=[a,x2)    =[0,3

Blurred answer
Students have asked these similar questions
Calculate the optimal path from g to a using A* algorithm (as heuristic function, use the provided table)
Given the figure below, using the Greedy-Best First search find ifit is optimal /admissible or not? Explain why?
he heuristic path algorithm is a best-first search in which the objective function is f(n) = (4 −w)g(n) + wh(n). For what values of w is this algorithm guaranteed to be optimal? What kind of search does this perform when w = 0? When w = 1? When w = 4?

Chapter 11 Solutions

Operations Research : Applications and Algorithms

Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole