Lec-8 Primal-Dual Algorithm

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

КОМЕНТАРІ • 10

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

    With v as a decision variable in the dual of the restricted primal, and Aj as coefficients of restricted primal decision variable Xj in the constraints, and Cj the coefficient of Xj in objective function, I understand :
    v * Aj 0 ?
    I can't understand this!!!

  • @davidplacci2955
    @davidplacci2955 8 років тому +3

    @8:24, shouldn't it be "v1

  • @pauser21
    @pauser21 12 років тому +1

    dear sir, if your variables X3 and X4 have not a sign constraint ( >=0) it means the third and fourth constraints in the dual are equal to zero (=0) not (

  • @ikrammessellek6528
    @ikrammessellek6528 5 років тому

    Hi do you have the written version of this algorithem

  • @rayamericoflores4752
    @rayamericoflores4752 8 років тому +4

    no0 entiendo nada... pero buen vídeo

  • @2mallikharjuna
    @2mallikharjuna 13 років тому +1

    He Is transposing matrix, but he is not mention in the lectular

  • @King30689
    @King30689 9 років тому

    @ 23:55, shouldn't Cj - Zj = 184/5? Please clarify!