Simplex Algorithm is not polynomial time- An example - Linear programming and Extensions - Prof. Prabha Sharma - Lecture 39 of 40 - Video-lecture

Video-lecture, Linear Programming

Description: This Lecture is delivered at IIT Kanpur by Prof.Prabha Sharma.Topic of this lecture is Simplex Algorithm is not polynomial time- An example.This is Lecture No 39 of this series.
Docsity is not optimized for the browser you're using. In order to have a better experience please switch to Google Chrome, Firefox, Internet Explorer 9+ or Safari! Download Google Chrome