@DATABASE PULITO
@VER$ PULITOİ v0.9beta
@WIDTH 72
@HEIGHT 200
@NODE MAIN "PULITOİ v1.0 beta"


                  PPPPP   U    U  L       IIIII   TTTTT    OOO   
                  P    P  U    U  L         I       T     O   O  
                  P    P  U    U  L         I       T     O   O  
                  PPPPP   U    U  L         I       T     O   O  
                  P       U    U  L         I       T     O   O  
                  P       U    U  L    L    I       T     O   O  
                  P        UUUUU  LLLLLL  IIIII     T      OOO   

	                             PULITOİ
			      v1.0 beta (25-7-1996)
					by
				  Stefano Avanzo
			       (huels@dei.unipd.it)

	                     @{"     What is          " LINK Cosa}
	                     @{"     Requirements     " LINK Requisiti}
			     @{"     How use it       " LINK Comesiusa}
	                     @{"     Copyrights       " LINK Copyrights}
			     @{"     Aknowledgements  " LINK Ringraziamenti}
	                     @{"     Greetings        " LINK Saluti}
			     @{"     Music?           " LINK Musica}
@ENDNODE

@NODE Cosa "What is"

	Is a program to solve linear and integer linear programming problems using
	the simplex algorithm in tableau shape. Although it was created appositely
	to help the students of an Operative Research class, it can be useful for
	the resulution of any optimization problem too.
	The program solve actually general problems of type:

		    /
		    |	min    cX
		   /	
		   \	 AX=b
		    |
		    \	 X>=0 (Integer or not)

	where c is a vector of coefficients, X is the vector which rappresent the
	problem variables, A is a matrix  m x n of coefficients,
	X is the same vector of before and b is a vector of known terms.
	The program then solve a problem in which we have to find the minimum of
	a certain expression at varying of variables( X ), and contemporaryly,
	the value of the solution must appease at the bond system AX=b.
	

	(Note that the variables not present in the optimal solution are
	 at zero value).
	
@ENDNODE

@NODE Comesiusa "How use it"
	
	We have to insert the objective function(in minimum shape) coefficients 
	and of the bond system.
	The program is useful because it show all the passages due to the 
	simplex method application in tableau shape.
	These passages in fact, are required for a scripture esamination of 
	Operative Research, and for example, to be sure of the exercise solution
	correctness we can use PULITO.
	The showed tableau are on the shape:


	----------------------------------------
        |	|	|	|	|	|  <--objective function coefficients
   	----------------------------------------	(from the second column
	|	|	|	|	|	|	because the first row and
	----------------------------------------	first column term is 
   /->	|	|	|	|	|	|<--\	the current obj. function
   |	----------------------------------------    |	value, changed of sign.)
   on the first column                              /    
   there are the known terms                       /    
   (but not the first element)                    /
                                        after the first row there are
					the bond coefficients

	For using of the dual algorithm we have to specify the basis variables
	correspondent at the bonds coefficients insertion order.
	For the integer optimal solution is necessary use the Gomory algorithm,
	and in this case will be show the added bonds at the original tableau.
	Pulito can solve a amximum of 100 x 100 tableau.
	Pulito B&B is a version which use a Branch and Bound limitated at 10
	subproblems.


@ENDNODE

@NODE Copyrights

	 PULITO is Freewere but all rights are reserved. You can copy as you wish, but: 
	 the archive must remain intact, and only a nominal fee can be charged for
	 its distribution.
	 Aminet and similar low-price CD collections are allowed to spread PULITO
	 until their price stays under 35.- DM. Now stop reading this and spread 
	 PULITO. ;>

         This software is provided "AS IS" without warrany of any kind, either
	 expressed or implied. By using it, you assume the entire risk as to the 
	 quality and performance of the program.
@endnode
	
	

@ENDNODE

@NODE Ringraziamenti "Aknowledgements"

@{fg highlight}@{b}I wish to thank:@{ub}@{fg text}

@{fg highlight}Chris Hülsbeck (or Huelsbeck),@{fg text} for his wonderful musical creations.

@{fg highlight}All Amiga programmers:@{fg text} thanks for supporting this wonderful machine.

@{fg highlight}Aminet,@{fg text} for the hundreds of megabytes of PD software.

@{fg highlight}Commodore,@{fg text} for the money the give to original amiga "parents" and for CBM16, CBM64 and CBM128. Too bad it's gone...

@{fg highlight}Escom AG,@{fg text} for giving the Amiga new life (let's hope so)


@ENDNODE


@NODE Saluti "Greetings"

@{fg highlight}@{b}Greetings go to:@{ub}@{fg text}

@{fg highlight}De Marchi Marina, Marco Zuliani@{fg text}, my friends at University.

@{fg highlight}Sergio Serena,@{fg text}  Assembly programmer. He own an A4000/30.

@{fg highlight}Luca Giolo,@{fg text}  Amos programmer, manga & anime fan. He own an A1200/30/881.

@{fg highlight}Stefano Osti,@{fg text}  Amos programmer. He own an A500+.

@{fg highlight}Ilario Moretto,@{fg text}  manga & anime fan, musicians in the free time. He own an A1200 and a CBM64! Soon you should find some of his modules on Aminet


@{fg highlight}@{b}And at all the people wich know me.@{ub}@{fg text}

	


@ENDNODE
	
@NODE Requisiti "Requirements"

	It require a minimum of AmigaDOS1.3 for the O.S, and for the memory
	and the rest :

	 PULITO		|-->	200Kb RAM free, 68020/30/40 with 68881/82 

	 PULITOB&B 	|-->	900Kb RAM free, 68020/30/40 with 68881/82

	 PULITO68000	|-->	250Kb RAM free, 68000(!?)

	 PULITOB&B68000	|-->	950Kb RAM free, 68000

@ENDNODE

@NODE Musica "Music"

	From the same author, on Aminet there are the follow musics:
	mods/dream/DaitarnIII.lha
	mods/dream/Glodrake.lha
	mods/dream/Mazinga.lha
@ENDNODE