PGAFitness(3) on Linux
The text 78acf0523216, as Debian 1.1 (Buzz) shipped it.
Maps the user's evaluation function value to a fitness value. First, the user's evaluation function value is translated to all positive values if any are negative. Next, this positive sequence is translated to a maximization problem if the user's optimization direction was minimization. This positive sequence is then mapped to a fitness value using linear ranking, linear normalization fitness, or the identity (i.e., the evaluation function value). This routine is usually used after PGAEvaluate is called.