Це відео не доступне.
Перепрошуємо.

Dual Programming Part 2: How to write the dual programming of a linear programming problem

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

КОМЕНТАРІ • 23

  • @youssefadiem8560
    @youssefadiem8560 2 роки тому +8

    Well done ! The walkthrough is really clear.. probably the best in UA-cam for this subject !

  • @turnernims2837
    @turnernims2837 Рік тому +2

    this is the best explanation of duality that I've ever seen

  • @gud_vibesm
    @gud_vibesm 4 місяці тому +1

    bro i love u mirzae! literally the amazing lecture i have got to understand duality! HUGE RESPECT FOR YOU! Thank u so much for making the decision of creating a videos on LP Programming and then uploading it.

  • @Goodvibesonly_heart
    @Goodvibesonly_heart 3 роки тому +2

    You are amazing at explaining this topic! Thank you!

  • @PunmasterSTP
    @PunmasterSTP 2 роки тому +1

    Dual programming part 2? More like "I want to give another big thankyou to you!" These videos are amazing, and judging from the comments, they have helped many people.

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

    This video is levels above the other videos on this topic

  • @anangelsdiaries
    @anangelsdiaries 9 місяців тому

    This makes so much sense. Many thanks. God bless you.

  • @elliebrown2120
    @elliebrown2120 2 роки тому +5

    Thanks so much! This helped understand how to state the dual problem. I never understood how to do it until I watched this video. My teacher didn't formally teach us how to do this, he just provided a video for us to watch, but the video show this. It just maximization problems. I mean it didn't even show minimization problems. It was just a really crappy video. Thanks again! This video helped a ton!

    • @PunmasterSTP
      @PunmasterSTP 2 роки тому

      I was just curious; how'd the rest of your class go?

    • @elliebrown2120
      @elliebrown2120 2 роки тому +1

      @@PunmasterSTP Pretty well! I made an ‘A’ as my Final Grade in the class. Thanks for asking!

    • @PunmasterSTP
      @PunmasterSTP 2 роки тому

      @@elliebrown2120 You're most welcome for my asking, and thanks for responding; I'm glad it went well!

    • @elliebrown2120
      @elliebrown2120 2 роки тому +1

      @@PunmasterSTP It was nice chatting with you!

    • @PunmasterSTP
      @PunmasterSTP 2 роки тому

      @@elliebrown2120 I feel the same way; take care!

  • @bayechouabdelhadi2736
    @bayechouabdelhadi2736 3 роки тому +2

    you saved my life thank you very much

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

    great explanation!

  • @arsalanyaghoubi6351
    @arsalanyaghoubi6351 4 роки тому +2

    fascinating; thanks a TONE

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

    Thanks, It was very useful.

  • @abdal-kareemrajab7962
    @abdal-kareemrajab7962 3 роки тому +1

    Thank you a lot

  • @mohamadmirhakak8474
    @mohamadmirhakak8474 5 місяців тому

    Thank you very much! Perfect explanation! :)
    I’ve got a question. How do we deal with variables that are bounded to some certain values?
    For instance, we have a minimization problem in which variables x is greater than 1. Do we have to consider this as an additional constrain, let’s say x - 1 >= 0, and then convert it into a dual format? Am I right? Or there is a better way to do that?

  • @francescozhu917
    @francescozhu917 2 роки тому

    Which textbook did you mention? We are using Intro. to Operation Reaearch by Hillier, same?

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

    ty

  • @elahefallahi246
    @elahefallahi246 Місяць тому

    میرزایی جان یه ورژن فارسی هم بده ، من بدبخت امتحان دارم تو ایتالیا گیر کردم میخوام سریع تر اینو بفهمم ، یه جاهایی شو نفهمیدم . ولی در کل دمت گرم دستت درد نکنه