INSTRUCTIONS FOR RUNNING LINPROG
Put the initial tableau into file INTABL.DAT. For the standard MAX
problem, this file should look like the following, which is the
initial tableau for the peanut pecan problem.
4 4 0
' ' ' ' 'x' 'y'
'z' 0 3.50 1.80
'r' 960 -6 -5
's' 1760 -10 -11
The first number on the first line is the number of rows,
while the second number is the number of columns. The 0 signals
the program that this is a standard MAX problem. Put a 1 there for
a standard MIN problem. Note that variable names are quoted,
including the two quoted blanks. Variable names need not be single
letters, but may not be longer than 4 characters, for instance
x12, obj, y1, #mx1, 1->B.
To run a standard MIN problem, also put the initial tableau
in the file INTABL.DAT, but note the format of the file for
the transportation problem done in class, which is shown below.
6 6 1
' ' ' ' 'x' 'y' 'u' 'v'
'z' 0 10 15 12 16
'r' 30 -1 -1 0 0
's' 40 0 0 -1 -1
'a' 25 0 -1 0 -1
'b' 20 -1 0 -1 0
5
1000
1000
Note the 1 as the third number on the first row signaling the
program that this is a MIN problem. Note that the objective
function is entered without the penalty costs, just as for a
MAX problem. The software will add the penalty costs to the
objective function, but you must tell it what row the artificial
variables begin on (row 5), and what the penalty costs are to be
(1000 for both rows 5 and 6). This is the purpose of the last three
lines in the file. The artificial variables must be at the bottom
of the tableau.
The INTABL.DAT file is not read formatted, and so there is no
need to worry about which column the numbers are in. You will find
the output tableaux in the file OUTTABL.DAT.
Note: For doing game theory solutions by the simplex method, the
output does not give enough decimal places. Go into the
SUBROUTINE STANMAXPROB and change the format so
that the 12F10.2 is 12F10.5.