summaryrefslogtreecommitdiff
path: root/Linear_Algebra_And_Its_Applications_by_G._Strang/CHAPTER8.ipynb
blob: ff8dc5c8b0260478fbb17c5cf482c36d8aaac62d (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
{
 "cells": [
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "# Chapter 8 - Linear Programming and Game Theory"
   ]
  },
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "## Ex:8.2.2 Pg: 238"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 2,
   "metadata": {
    "collapsed": false
   },
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "New corner: [ 0.          0.          0.          0.33333333  3.        ]\n",
      "Minimum cost: -9.33333333333\n"
     ]
    }
   ],
   "source": [
    "from scipy.optimize import linprog\n",
    "from numpy import array, transpose\n",
    "A=array([[1, 0 ,1 ,6, 2],[0, 1, 1, 0, 3]])\n",
    "b=transpose(array([8, 9]))\n",
    "c=transpose(array([0, 0, 7 ,-1, -3]))\n",
    "lb=transpose(array([0, 0 ,0 ,0 ,0]))\n",
    "ub=[]\n",
    "ans=linprog(c,A,b)\n",
    "x=ans.x\n",
    "f=ans.fun\n",
    "print 'New corner:',x\n",
    "print 'Minimum cost:',f"
   ]
  }
 ],
 "metadata": {
  "kernelspec": {
   "display_name": "Python 2",
   "language": "python",
   "name": "python2"
  },
  "language_info": {
   "codemirror_mode": {
    "name": "ipython",
    "version": 2
   },
   "file_extension": ".py",
   "mimetype": "text/x-python",
   "name": "python",
   "nbconvert_exporter": "python",
   "pygments_lexer": "ipython2",
   "version": "2.7.9"
  }
 },
 "nbformat": 4,
 "nbformat_minor": 0
}