A SEARCH METHOD IN CONVEX PROGRAMMING
Michael Rogson · 1965
Abstract : A search method for solving both the linear programming problem and a more general class of convex programming problems with the 7090 computer, using artificial evolution techniques, is presented. Flow diagrams are given for the program. In special cases, the results of this method and the known values are compared. Also tables of the computed results are given.