Solving LPs with mixed type of constraints

แชร์
ฝัง
  • เผยแพร่เมื่อ 21 ต.ค. 2024
  • Module 5 : Primal-Dual Relationships
    Lec 24 : Solving LPs with mixed type of constraints
    To access the translated content:
    1. The translated content of this course is available in regional languages. For details please visit nptel.ac.in/tr...
    The video course content can be accessed in the form of regional language text transcripts, books which can be accessed under downloads of each course, subtitles in the video and Video Text Track below the video.
    Your feedback is highly appreciated. Kindly fill this form forms.gle/XFZh...
    2. Regional language subtitles available for this course
    To watch the subtitles in regional languages:
    1. Click on the lecture under Course Details.
    2. Play the video.
    3. Now click on the Settings icon and a list of features will display
    4. From that select the option Subtitles/CC.
    5. Now select the Language from the available languages to read the subtitle in the regional language.

ความคิดเห็น • 6

  • @ShibaShankar
    @ShibaShankar 4 ปีที่แล้ว

    Can anyone clarify what method is to be used in general for a problem with mix type of constraints? Suppose a minimization problem is given with mix constraints, then which method shall we use? Can the Big M method be used or is it to be solved by Dual simplex / primal simplex?

    • @jeffersonluke4774
      @jeffersonluke4774 3 ปีที่แล้ว

      i guess it's pretty randomly asking but does anybody know a good website to stream newly released tv shows online?

    • @torincody8378
      @torincody8378 3 ปีที่แล้ว

      @Jefferson Luke flixportal

    • @jeffersonluke4774
      @jeffersonluke4774 3 ปีที่แล้ว

      @Torin Cody thank you, I went there and it seems like they got a lot of movies there :) I appreciate it!

    • @torincody8378
      @torincody8378 3 ปีที่แล้ว

      @Jefferson Luke you are welcome xD

    • @vandanags8449
      @vandanags8449 9 หลายเดือนก่อน

      what I understood is that every minimisation problem is converted to a maximisation problem by multiplying with -1, then for regular simplex to apply we can use the big m method (big m is always used for a greater than or equal to constraint and so we have to introduce an artificial variable or if I multiplying with -1 to change the constraint to less than or equal to resulting in a negative rhs) now if you have a negative rhs you can proceed by the dual simplex method. So basically, if you have mixed constraints, you can use any method based on what you do to the constraint and the sign of rhs.