- Видео 16
- Просмотров 15 233
ALOP Trier University
Добавлен 26 окт 2020
"Graph-Structured Nonlinear Programming: Properties and Algorithms" by Sungho Shin
Recording of a talk given by Sungho Shin at the ALOP colloquium at 2021-11-17.
Просмотров: 223
Видео
Optimization and Market Design: Rakesh Vohra on "Allocating Indivisible Goods" - Part 1/2
Просмотров 1973 года назад
Recorded at the ALOP autumn school on "Optimization and Market Design" in 2021
Optimization and Market Design: Rakesh Vohra on "Allocating Indivisible Goods" - Part 2/2
Просмотров 933 года назад
Recorded at the ALOP autumn school on "Optimization and Market Design" in 2021
Optimization and Market Design: Martin Bichler on "Equilibrium Computation in Markets"
Просмотров 2583 года назад
Recorded at the ALOP autumn school on "Optimization and Market Design" in 2021
The granularity concept in mixed-integer optimization
Просмотров 1933 года назад
Talk given by Prof. Dr. Oliver Stein from the Karlsruhe Institute of Technology (KIT), Germany, in the colloquium of the research training group (Algorithmic Optimization; alop.uni-trier.de) on May 17, 2021.
On numerical diffusion for entropy stable shock capturing schemes for hyperbolic conservation laws
Просмотров 2413 года назад
Talk given by Dr. Ritesh Kumar Dubey from SRM University Chennai in the colloquium of the research training group (Algorithmic Optimization; alop.uni-trier.de) on May 10, 2021.
Differential privacy of hierarchical census data: An optimization approach
Просмотров 903 года назад
Talk given by Prof. Dr. Pascal Van Hentenryck from the Georgia Tech, US, in the colloquium of the research training group (Algorithmic Optimization; alop.uni-trier.de) on May 10, 2021.
Pricing in Resource Allocation Games
Просмотров 2043 года назад
Talk given by Prof. Dr. Tobias Harks from the University of Augsburg, Germany, in the colloquium of the research training group (Algorithmic Optimization; alop.uni-trier.de) on April 19, 2021.
Linear Programming and Prophet Inequalities
Просмотров 2953 года назад
Talk given by Rakesh Vohra from the University of Pennsylvania in the colloquium of the research training group (Algorithmic Optimization; alop.uni-trier.de) on November 23, 2020.
Hierarchical energy based modeling, simulation and control of multi-physics systems
Просмотров 1624 года назад
Talk given by Volker Mehrmann from the TU Berlin in the colloquium of the research training group (Algorithmic Optimization; alop.uni-trier.de) on November 9, 2020.
Bilevel Problems, MPCCs, and Multi-Leader-Follower Games - Part 2/2
Просмотров 4914 года назад
Lecture by Didier Aussel at the ALOP Autumn School on Bilevel Optimization (October 14, 2020)
Bilevel Problems, MPCCs, and Multi-Leader-Follower Games - Part 1/2
Просмотров 1,2 тыс.4 года назад
Lecture by Didier Aussel at the ALOP Autumn School on Bilevel Optimization (October 14, 2020)
Branch-and-Cut Solvers for Mixed-Integer Bilevel Linear Programs - Part 2/2
Просмотров 6764 года назад
Lecture by Ivana Ljubic at the ALOP Autumn School on Bilevel Optimization (October 13, 2020)
Branch-and-Cut Solvers for Mixed-Integer Bilevel Linear Programs - Part 1/2
Просмотров 1,5 тыс.4 года назад
Lecture by Ivana Ljubic at the ALOP Autumn School on Bilevel Optimization (October 13, 2020)
Introduction to Bilevel Optimization, Linear Bilevel Problems, and Maybe Beyond - Part 2/2
Просмотров 2,4 тыс.4 года назад
Lecture by Martine Labbé at the ALOP Autumn School on Bilevel Optimization (October 12, 2020)
Introduction to Bilevel Optimization, Linear Bilevel Problems, and Maybe Beyond - Part 1/2
Просмотров 7 тыс.4 года назад
Introduction to Bilevel Optimization, Linear Bilevel Problems, and Maybe Beyond - Part 1/2
Solve the inventory problem using bi-level programming؟I need to formulate the issue
Good 👍
Great lecture thanks.
Great presentation. I'm a bit confused by the bilevel-free set S here 1:07:00, the theorem box, at the bottom, says "does not contain any bilevel-feasible point (not even on its frontier)" I'm wondering if there is a typo and should say INfeasible instead of feasible, like so, "... any bilevel-infeasible point..." ?
I think there is no typo there. In order for the intersection cut to be valid, the set should not contain bilevel-feasible points (indeed the constraint d^T y > d^T \hat{y} enforce that, because then S(\hat{y}) has no optimum solutions for the follower subproblem).
Great talk, Pascal! Came across it accidentally researching DP for a project in my new job. I guess now I have a familiar expert to reach out for help if needed :-) Hope you are well at Georgia Tech, wishing all the best! Yury
Thanks a lot Prof. Martine. Great introduction for interested students in this topic.
Link to Part 2?
Thanks for the valuable information.