Lecture 10a: Benders’ decomposition: Applications

Поделиться
HTML-код
  • Опубликовано: 2 янв 2025

Комментарии • 7

  • @yuanxiwu9451
    @yuanxiwu9451 3 года назад

    Thank you! This course is really helpful and it makes Bender's Decomposition much easier to understand.

  • @naghipakdaman
    @naghipakdaman Год назад

    Very very useful....

  • @haotianwu9659
    @haotianwu9659 3 года назад +1

    Really enjoyed your lectures and teaching style! I am wondering if there will be other courses of this kind (PhD level optimization-related) available on your channel in the future so that I can learn more.

  • @souravdas1710
    @souravdas1710 Год назад

    sir sub problem can be non-linear prog, QP , ??

  • @yingkaisong4258
    @yingkaisong4258 3 года назад

    Dear Prof., I like your lecture, but I think it might be better to make it clear (my apologize if you clarified this but I did not notice) an important assumption that the subproblems must be convex to use the classical (or generalized ) Bender decomposition. It is a more advanced topic to deal with a general nonconvex NLP or MINLP problem.

    • @MohsenAldaadi
      @MohsenAldaadi 2 года назад +1

      He already did in the previous lecture.