Inverse programming: Theory and examples
In this paper some simple ideas about ordered sets and inverse functions are developed into a theory of inverse pairs of optimization problems. This relationship is shown to permit the use of root-finding methods to find a solution for one problem through a sequence of solutions to the other. A variety of problems showing this relationship are presented as examples.