Lecture

Two-Stage Stochastic Programs

In course

Est in deserunt laborum proident esse aliquip et enim sint ipsum. Magna ea consectetur irure minim proident. Mollit sunt adipisicing culpa occaecat cillum ex non qui magna laboris incididunt tempor voluptate eu. Consequat nostrud labore laboris laboris in fugiat adipisicing amet. Tempor proident elit ullamco laboris anim voluptate occaecat eiusmod esse laboris ea pariatur eu. Ad do nostrud tempor occaecat labore qui quis laboris est laboris. Reprehenderit dolor laborum Lorem nostrud duis dolor.

Description

This lecture covers Two-Stage Stochastic Programs, focusing on problem reformulation and Benders decomposition algorithm. It explains how to fix x to determine optimal second stage decisions yw separately, and solve the master problem to optimize over x. The instructor discusses the characteristic structure of these programs and how to exploit it. The lecture also delves into primal and dual subproblems, extreme points, recession cones, and extreme directions. It concludes with global and local sensitivity analysis, exploring the impact of changes in c, b, and problem constraints on optimality. The general framework for Local Sensitivity Analysis is presented, emphasizing the conditions under which the current basis remains optimal.

Instructor

eu aute Lorem nisi

Anim qui fugiat do esse excepteur. Pariatur sint officia aute tempor ut labore irure voluptate ullamco ut tempor. Duis reprehenderit ea minim consectetur duis ex adipisicing dolore id id do culpa. Mollit fugiat amet officia laborum sunt do id id. Voluptate commodo nostrud sit ea eu nulla. Tempor reprehenderit adipisicing qui et incididunt id consequat sunt laboris minim.

Official source

https://mediaspace.epfl.ch/media/0_ujmj0js1

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Combinatorial optimization

Related lectures (33)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.