A few comparisons are included.

SWI-Prolog's simplex library is used to determine the locally best direction. The central predicate is

- in: objective function
- in: matrix A, as a list of rows
- in: b, the right-hand side of the linear constraints
- in: starting position
- out: computed optimum

Example:

maximize(- ((x(1) - 2)^2) - (x(2) - 4)^2, [[1,1],[1,-1],[1,0],[-1,0]], [4,0,1,0], [0,0], Max). Max = [1, 3] ;

htmlify.el: M-x htmlify on a region replaces "ä" by "ä", "ß" by "ß" etc.