Abstract
This paper presents an algorithm for finding all the equilibria for a k-ailelic system undergoing panmixia and selection. Elementary methods of quadratic programming are used to generate the set of equilibrium values and a test for stationarity is also given. The techniques which are developed are used to investigate 2 classical selection situations.

This publication has 1 reference indexed in Scilit: