-----------------

SIMPLEX ALGORITHM for TI-89, TI-92[+]

----------------- v.2.02
With STEPWISE option.

CONTENTS
--------
- How to Install
- Compatibility
- Using the program
- Examples
- Known Bugs
- History
- Credits

HOW TO INSTALL
--------------
Extract the files in the ZIP to some directory.
> Using a TI-GRAPH LINK Cable
Connect your calculator and using the TI-GRAPH LINK program, select
LINK, SEND..., search ENGLISH.89g file and double click it, select OK,
once the files are sent open the VAR-LINK, then archive it.
> Using a Homemade Cable
Connect your calculator and using a program like WTRANX, search ENGLISH.89g
file and double click it, once the files are sent run SIMPLEX() from your
calculator and wait around 10 seconds for program's compilation, when you
see the Simplex' window press ESC to quit and open the VAR-LINK, then
archive it.

COMPATIBILITY
-------------
This program was created on a TI-89 HW1, AMS 2.03, also tested on AMS 1.00.
It's fully compatible with TI-92 and TI-92 Plus (All ROMs, All HW).

USING THE PROGRAM

-----------------
* Stepwise
Applies simplex step by step, showing pivot element and row operations
applied.
z and w letters are not shown.
You can save a registry of applied operations named SIMPLOG.

* Only solution
Shows the optimal solution, if exists.
The program saves this solution in a variable named 'result'
* Create tableaux
Use it to easily create the simplex tableaux, you don't have to put slack or
artificial variables because the program creates it.
This tableaux is a matrix named 'mat'
z function must be entered in this way: [x1,x2,...,xn,-zø]
and similary the restrictions: [x1,x2,¡,xn,bm] indicating the type of
inecuation.
Restrictions xi >= 0 aren't necessary to be included.

EXAMPLES
--------
Note:
< means <= (less than or equal to) and
> means >= (greater than or equal to)

Example 1.
Min z = y - x + 1, subject to:
-2x + y < 2
x -2y < 2
x + y < 5
x, y > 0
If you create the tableaux with tsimplex:
Num of restrictions : 3
Objective function : [-1,1,-1]
Problem : Min
Restrictions
1: [-2,1,2] <
2: [1,-2,2] <
3: [1,1,5] <
mat will be:
-2 1 1 0 0 2
1 -2 0 1 0 2
1 1 0 0 1 5
-1 1 0 0 0 -1
and numvart=0
the final solution is [4,1,9,0,0]
You can obtain z evaluating this solution:
z = -(4)+(1)+1 = -2

Example 2. (Artificial variables)

Max z = -2x + y + 1, subject to:
 2x + y > 4
-x + y < 4
-3x + y >-15
x < 7
x, y > 0

Num of restrictions : 4
Objective function : [-2,1,-1]
Problem : Max
Restrictions
1: [2,1,4] >
2: [-1,1,4] <
3: [-3,1,-15] >
4: [1,0,7] <

mat will be:

2 1 -1 0 0 0 1 4
-1 1 0 1 0 0 0 4
3 -1 0 0 1 0 0 15
1 0 0 0 0 1 0 7
2 -1 0 0 0 0 0 1
-2 -1 1 0 0 0 0 -4
and numvart=1
the final solution is [0,4,0,0,19,7]
z= -2(0)+4(1)+1 = 5

KNOWN BUGS
----------
> If you have AMS 2.0x (TI-89 only) it's necessary to deactivate the
alpha-lock on each dialog box.
> Remenber that when you send this program from a computer it takes
around 10 seconds to compile.
HISTORY
-------
> v.2.02
A bug fixed (Thanks to Clark Jea).
> v.2.01
Some enhancements.
> v.2.0
Previous 4 subprogramas in 1.
Registry option added.
Error recovery added.
> v.1.2.2
Spelling errors corrected.
TI-92 incompatibility fixed (Thanks to Juan Carlos Carvajal)
Algorithm bugs fixed.
> v.1.2.1
A few little changes.
> v.1.2
New interface, help text updated.
> v.1.1
simplex() fixed, now compatible with TI-92 Plus.
> v.1.0
First version, incompatible with TI-92, TI-92 Plus.

CREDITS
-------
Programmed by:
Esteban Richmond S.
ersiq@costarricense.cr
Send your comments, questions and errors that you find related with
this program.