V5 10: Linear Programming: The Dual Simplex Algorithm

Поділитися
Вставка
  • Опубліковано 31 жов 2024

КОМЕНТАРІ • 8

  • @alipedram5720
    @alipedram5720 3 роки тому +3

    The lectures are very clear and informative. Thank you.

  • @nodirbek3272
    @nodirbek3272 8 місяців тому

    Great explanation. Thanks for your work. You are a really talented teacher.

  • @lyd974
    @lyd974 Рік тому

    Thanks for that, it was really helpful since i was digging in this rabbit hole for weeks

  • @iamtrash288
    @iamtrash288 3 роки тому +1

    But what if some of the objective function's coefficients are negative? Do we use primal to make them positive first?

  • @evilscarlettalias1941
    @evilscarlettalias1941 Рік тому

    AN INTRODUCTION TO
    LINEAR PROGRAMMING
    AND GAME THEORY Paul R. Thie
    G. E. Keough
    book lo nunchi dimpesavv kadaa brooo

  • @NabidAlam360
    @NabidAlam360 3 роки тому

    Why the row -9 -2 was not multiplied by -1 on both sides and then writing on the Tableau?