Duality Theory is an important topic in LP. Here we provide a simple facility to compose - on the fly - the dual problems associated with given (numerical) instances of the primal. In the future we may expand this facility to cover non-numeric instances.
Please note that the Duality Machine is very conservative: it will not attempt to simplify the dual, say, by identifying superfluous constraints. Nor will it try to check whether the dual (or primal) are feasible or bounded.