Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 4.4, Problem 7P
Explanation of Solution
Linear
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
A seller has an indivisible asset to sell. Her reservation value for the asset is s, which she knows privately. A potential buyer thinks that the assetís value to him is b, which he privately knows. Assume that s and b are independently and uniformly drawn from [0, 1]. If the seller sells the asset to the buyer for a price of p, the seller's payoff is p-s and the buyer's payoffis b-p.
Suppose simultaneously the buyer makes an offer p1 and the seller makes an offer p2. A transaction occurs if p1>=p2, and the transaction price is
1/2 (p1 + p2). Suppose the buyer uses a strategy p1(b) = 1/12 + (2/3)b and the seller uses a strategy p2(s) = 1/4 + (2/3)s. Suppose the buyer's value is 3/4 and the seller's valuation is 1/4. Will there be a transaction? Explain. Is this strategy profile a Bayesian Nash equilibrium? Explain.
You are an investor who receives daily price quotes for a stock. The span of a stock's price on a given day
is the number of consecutive days, from the given day going backwards, on which its price was less than
or equal to its price on the day we are considering. Thus, the Stock Span Problem is as follows: Given a
series of daily price quotes for a stock, find the span of the stock on each day of the series.
Assume you are given seven daily stock quotes: 3, 10, 4, 7, 9, 6, and 8.
Assume further that these stock quotes are stored in the array quotes. Show a step-by-step, manual
desk-check execution of the algorithm below showing the values of all variables and arrays for each
step in each cycle of each loop, as demonstrated in clase
Algorithm: A Simple Stock Span Algorithm
SimpleStockSpan (quotes)
spans
Input: quotes, an array with n stock price quotes
Output: spans, an array with n stock price spans
1 spans CreateArray (n)
2 for i-0 to n do
k+1
span_endFALSE
while i-k 20 and not…
You are an investor who receives daily price quotes for a stock. The span of a stock's price on a given day
is the number of consecutive days, from the given day going backwards, on which its price was less than
or equal to its price on the day we are considering. Thus, the Stock Span Problem is as follows: Given a
series of daily price quotes for a stock, find the span of the stock on each day of the series.
Assume you are given seven daily stock quotes: 3, 10, 4, 7, 9, 6, and 8.
Assume further that these stock quotes are stored in the array quotes. Show a step-by-step, manual
desk-check execution of the algorithm below showing the values of all variables and arrays for each
step in each cycle of each loop, as demonstrated in clase
Algorithm: A Simple Stock Span Algorithm
SimpleStockSpan (quotes) → spans
Input: quotes, an array with n stock price quotes
Output: spans, an array with n stock price spans
2
3
4
5
6
7
8
10
11
spans CreateArray (n)
←
for i0 to n do
k 1
span_end FALSE
while…
Chapter 4 Solutions
Operations Research : Applications and Algorithms
Ch. 4.1 - Prob. 1PCh. 4.1 - Prob. 2PCh. 4.1 - Prob. 3PCh. 4.4 - Prob. 1PCh. 4.4 - Prob. 2PCh. 4.4 - Prob. 3PCh. 4.4 - Prob. 4PCh. 4.4 - Prob. 5PCh. 4.4 - Prob. 6PCh. 4.4 - Prob. 7P
Ch. 4.5 - Prob. 1PCh. 4.5 - Prob. 2PCh. 4.5 - Prob. 3PCh. 4.5 - Prob. 4PCh. 4.5 - Prob. 5PCh. 4.5 - Prob. 6PCh. 4.5 - Prob. 7PCh. 4.6 - Prob. 1PCh. 4.6 - Prob. 2PCh. 4.6 - Prob. 3PCh. 4.6 - Prob. 4PCh. 4.7 - Prob. 1PCh. 4.7 - Prob. 2PCh. 4.7 - Prob. 3PCh. 4.7 - Prob. 4PCh. 4.7 - Prob. 5PCh. 4.7 - Prob. 6PCh. 4.7 - Prob. 7PCh. 4.7 - Prob. 8PCh. 4.7 - Prob. 9PCh. 4.8 - Prob. 1PCh. 4.8 - Prob. 2PCh. 4.8 - Prob. 3PCh. 4.8 - Prob. 4PCh. 4.8 - Prob. 5PCh. 4.8 - Prob. 6PCh. 4.10 - Prob. 1PCh. 4.10 - Prob. 2PCh. 4.10 - Prob. 3PCh. 4.10 - Prob. 4PCh. 4.10 - Prob. 5PCh. 4.11 - Prob. 1PCh. 4.11 - Prob. 2PCh. 4.11 - Prob. 3PCh. 4.11 - Prob. 4PCh. 4.11 - Prob. 5PCh. 4.11 - Prob. 6PCh. 4.12 - Prob. 1PCh. 4.12 - Prob. 2PCh. 4.12 - Prob. 3PCh. 4.12 - Prob. 4PCh. 4.12 - Prob. 5PCh. 4.12 - Prob. 6PCh. 4.13 - Prob. 2PCh. 4.14 - Prob. 1PCh. 4.14 - Prob. 2PCh. 4.14 - Prob. 3PCh. 4.14 - Prob. 4PCh. 4.14 - Prob. 5PCh. 4.14 - Prob. 6PCh. 4.14 - Prob. 7PCh. 4.16 - Prob. 1PCh. 4.16 - Prob. 2PCh. 4.16 - Prob. 3PCh. 4.16 - Prob. 5PCh. 4.16 - Prob. 7PCh. 4.16 - Prob. 8PCh. 4.16 - Prob. 9PCh. 4.16 - Prob. 10PCh. 4.16 - Prob. 11PCh. 4.16 - Prob. 12PCh. 4.16 - Prob. 13PCh. 4.16 - Prob. 14PCh. 4.17 - Prob. 1PCh. 4.17 - Prob. 2PCh. 4.17 - Prob. 3PCh. 4.17 - Prob. 4PCh. 4.17 - Prob. 5PCh. 4.17 - Prob. 7PCh. 4.17 - Prob. 8PCh. 4 - Prob. 1RPCh. 4 - Prob. 2RPCh. 4 - Prob. 3RPCh. 4 - Prob. 4RPCh. 4 - Prob. 5RPCh. 4 - Prob. 6RPCh. 4 - Prob. 7RPCh. 4 - Prob. 8RPCh. 4 - Prob. 9RPCh. 4 - Prob. 10RPCh. 4 - Prob. 12RPCh. 4 - Prob. 13RPCh. 4 - Prob. 14RPCh. 4 - Prob. 16RPCh. 4 - Prob. 17RPCh. 4 - Prob. 18RPCh. 4 - Prob. 19RPCh. 4 - Prob. 20RPCh. 4 - Prob. 21RPCh. 4 - Prob. 22RPCh. 4 - Prob. 23RPCh. 4 - Prob. 24RPCh. 4 - Prob. 26RPCh. 4 - Prob. 27RPCh. 4 - Prob. 28RP
Knowledge Booster
Similar questions
- Detecting Type-B Arbitrage with (ADLP) - Practice For type-B arbitrage the following conditions neèd to be satisfied: Po(y) = E söx; s0, (i) i=0 ES{(w; )x; > 0, j = 1, 2, ..., m, (ii) i=0 in Es{(w;)x; > 0 for at least one index j (ii) i=0 We can find such an investment x (if one exists) by solving ОРТ min - j=1 i=0 subject to S;(w;)x; > 0, j = 1, 2, . . . , m. (ADLP) i=0 in Sóx; <0 i=0 Define OPT = -o if the problem is unboundedarrow_forwardminimum and maximum acceleration of the parameter s for the time-optimal path-constraint trajectory planning -(lagrangian mechanics-Ordinary differantial equations-ode45) lagrangian formulation of dynamics ode45 matrix fill in the blanks where it says "Fill" in the first pitcurearrow_forwardWe have learned the mid-point and trapezoidal rule for numercial intergration in the tutorials. Now you are asked to implement the Simpson rule, where we approximate the integration of a non-linear curve using piecewise quadratic functions. Assume f(x) is continuous over [a, b] . Let [a, b] be divided into N subintervals, each of length Ax, with endpoints at P = x0, x1, X2, ..., Xn,..., XN. Each interval is Ax = (b – a)/N. The Simpon numerical integration rule is derived as: N-2 Li f(x)dx = * f(x0) + 4 (2n odd f(xn)) + 2 ( En=2,n even N-1 f(x,) + f(xn)] . Now complete the Python function InterageSimpson(N, a, b) below to implement this Simpson rule using the above equation. The function to be intergrate is f (x) = 2x³ (Already defined, don't change it). In [ ]: # Complete the function given the variables N,a,b and return the value as "TotalArea". # Don't change the predefined content, only fill your code in the region "YOUR CODE" from math import * def InterageSimpson (N, a, b): # n is…arrow_forward
- We have learned the mid-point and trapezoidal rule for numercial intergration in the tutorials. Now you are asked to implement the Simpson rule, where we approximate the integration of a non-linear curve using piecewise quadratic functions. Assume f(x) is continuous over [a, b] . Let [a, b] be divided into N subintervals, each of length Ax, with endpoints at P = x0, x1, x2,.. Xn,..., XN. Each interval is Ax = (b − a)/N. The equation for the Simpson numerical integration rule is derived as: f f(x) dx N-1 Ax [ƒ(x0) + 4 (Σ1,n odd f(xn)) ƒ(x₂)) + f(xx)]. N-2 + 2 (n=2,n even Now complete the Python function InterageSimpson (N, a, b) below to implement this Simpson rule using the above equation. The function to be intergrate is ƒ(x) = 2x³ (Already defined in the function, no need to change).arrow_forwardWe have learned the mid-point and trapezoidal rule for numercial intergration in the tutorials. Now you are asked to implement the Simpson rule, where we approximate the integration of a non-linear curve using piecewise quadratic functions. Assume f(x) is continuous over [a, b]. Let [a, b] be divided into N subintervals, each of length Ax, with endpoints at P = x0, x1,x2,..., X., XN. Each interval is Ax = (b − a)/N. The equation for the Simpson numerical integration rule is derived as: f f(x)dx ≈ [ƒ(x0) + 4 (EN-1,n odd S(x)) + 2 (Σ2²n even f(x)) + f(XN)]. Now complete the Python function InterageSimpson (N, a, b) below to implement this Simpson rule using the above equation. The function to be intergrate is f(x) = 2x³ (Already defined in the function, no need to change). *Complete the function given the variables N, a,b and return the value as "TotalArea"." "Don't change the predefined content' only fill your code in the region *YOUR CODE"" from math import * def InterageSimpson (N, a,…arrow_forwardLet = 1.8-1 + 30 be a linear DDS. a) Suppose the initial value is = 59. Find the explicit solution. In b) Calculate the equilibrium value for this DDS. Round to 2 decimal places as needed. Ie c) Determine the stability of the equilibrium. Choose the correct answer. The equilibrium of this system is Select an answer because the slope is negative. the slope in absolute value is greater than 1. the slope is positive. the slope in absolute value is less than 1.arrow_forward
- If the only information given about variable x2 in an LP is x2 ≥3, what modifications need to be made to the LP to put it in Canonical Inequality Form? You may assume that the rest of the problem is already in Canonical Inequality Form. Be specific and show your work.arrow_forwardConsider the points which satisfy the equation y² = x³ + ax + b mod p where a = 4, b = 6, and p = 23. Enter a comma separated list of points (x, y) consisting of all points in Z23 satisfying the equation. (Do not try to enter O, the point at infinity.) What is the cardinality of this elliptic curve group?arrow_forward1. In a two-class problem, the likelihood ratio is p(x|C₁) p(x|C₂) Write the discriminant function in terms of the likelihood ratio.arrow_forward
- Correct answer will be upvoted else downvoted. Computer science. Homer is given the plans of the country in the accompanying q years. The arrangement of the I-th year is portrayed by four boundaries ui,vi,li and ri, and he is approached to track down any mineral asset ci to such an extent that the accompanying two conditions hold: mineral asset ci seems an odd number of times between city ui and city vi; and li≤ci≤ri. As the closest companion of Homer, he asks you for help. For each arrangement, track down any such mineral asset ci, or let him know that there doesn't exist one. Input The main line contains two integers n (1≤n≤3⋅105) and q (1≤q≤3⋅105), demonstrating the number of urban areas and the number of plans. The subsequent line contains n integers a1,a2,… ,an (1≤ai≤n). Then, at that point, the I-th line of the accompanying (n−1) lines contains two integers xi and yi (1≤xi,yi≤n) with xi≠yi, demonstrating that there is a bidirectional street between city xi…arrow_forwardIn this question you will explore the Traveling Salesperson Problem (TSP). (a) In every instance (i.e., example) of the TSP, we are given n cities, where each pair of cities is connected by a weighted edge that measures the cost of traveling between those two cities. Our goal is to find the optimal TSP tour, minimizing the total cost of a Hamiltonian cycle in G. Although it is NP-complete to solve the TSP, we found a simple 2-approximation by first generating a minimum-weight spanning tree of G and using this output to determine our TSP tour. Prove that our output is guaranteed to be a 2-approximation, provided the Triangle Inequality holds. In other words, if OP T is the total cost of the optimal solution, and AP P is the total cost of our approximate solution, clearly explain why AP P ≤ 2 × OP T.arrow_forwardIn most of Europe and Asia annual automobile insurance is determined by the bonus malus system. Each policyholder is given a number (state) and the policy premium is determined as a function of this state. A policy holder's state changes from year to year in response to the number of claims made by the policy holder. Suppose the number of claims made by a particular policyholder in any given year, is a Poisson random variable with parameter A. Let. si(k) be the next state of a policyholder who was in state i in the previous year and who made k claims in that year. The following table is a simplified Bonus-Malus system having 4 states. Next state if Annual State O claims 1 claim 2 claims 3 or more claims Premium 1 200 3 4 250 1 3 4 4 400 2 4 4. 4 4 600 4 4 4 For A =2 A. Find the mean time to return to state 1 (if you start in state 1): (round to 2 decimals) B. Find the expected annual premium for a random person after it has been with the insurance company for a while: decimals) (round…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole