tuf22191

{
 "cells": [
  {
   "cell_type": "code",
   "execution_count": 133,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",

tuf22191

{
 "cells": [
  {
   "cell_type": "code",
   "execution_count": 2,
   "metadata": {
    "collapsed": true
   },
   "outputs": [],
   "source": [

tuf22191

{
 "cells": [
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "In this tutorial we are going to build our very own practical linear programming solver using the Simplex Method. We are going to do the standard MAXIMIZATION (not minimization) problem discussed in the video above (here is a link just in case: https://www.youtube.com/watch?v=XK26I9eoSl8&t=300s) . Another great article to understand linear programming some more is here https://www.analyticsvidhya.com/blog/2017/02/lintroductory-guide-on-linear-programming-explained-in-simple-english/. as well."
   ]
  },
  {

tuf22191

{
 "cells": [
  {
   "cell_type": "code",
   "execution_count": 15,
   "metadata": {
    "collapsed": true
   },
   "outputs": [],
   "source": [