Explore the Progressive Hedging algorithm discussed in the Graduate Seminar on Operations Research. Topics include general framework, resource allocation examples, and handling non-convexity in decision-making. Dive into scenario decomposition and scenario-specific decision-making for well-hedged so

0 views • 28 slides

Convex hulls are a fundamental concept in computational geometry, representing the smallest convex shape that contains a set of points. The process involves defining the convexity of a set, determining the unique convex polygon, and computing the convex hull efficiently using algorithms. This conten

0 views • 9 slides

Explore the fundamentals of bond valuation, including the present value model and the yield model, to understand how bond prices are determined based on factors like market price, coupon payments, and yield to maturity. Learn about the price-yield curve, convexity, and how to calculate expected yiel

0 views • 25 slides