Generalisation of dualities, what concept do dualities represent? Duality is a concept that pops up in different areas of mathematics as well as other science, but besides being a "woo isn't that nice?", is there anything more to duality (than loosely stated some type of isomorphic behaviour)?
Has anyone seen duality (trippliality?? or more) between more than two conceptual objects?
Edit : By "anything more" I mean a systematic study and categorisation of duality on its own, maybe a chapter in a book. For example the properties of holomorphic functions are studied separate of the specific holomorphic functions themselves, so one can look at holomorphic functions as a subject of study on it's own right. Looking for something similar regarding the concept of duality, not the specific objects having duality (or triality), can we have a definition of duality independent of specific examples? In other words can we say this is what is meant by a duality relationship (or triality) and show that specific examples actually satisfy the definition and hence they have duality relationship wrt each other?
Apologies for a very ill defined question, but I wouldn't even know what area does a question like this belongs to.
 A: It looks like you have two questions here.  This answer addresses the one about uses of duality.  (I'm interpreting "is there anything more to duality?" as "Are there any practical applications of duality?")
Not only is duality the most important theoretical concept in linear programming, it has a large number of useful applications.  For example:


*

*Any feasible solution to the dual problem gives a bound on the optimal solution to the original problem.

*Related to that, if the dual problem is unbounded then there is no solution to the original problem (i.e., the original problem is infeasible).

*Basic sensitivity analysis on the original problem (i.e., what happens to the optimal solution if we make small changes to the parameters in the original problem) can be done immediately by looking at the values of the optimal dual solution.

*If the dual problem is easier to solve than the original problem, you can determine the optimal solution to the original problem by solving the dual instead.

*For the transportation and assignment problems, two of the most important classes of linear programming problems, there are algorithms that exploit duality so that these problems can be solved much faster than when using the standard simplex method.

*There are some algorithms for solving general linear programs that work with both the original and the dual problem simultaneously.  See, for example, this answer on the primal-dual method.  Wikipedia also claims that "the class of primal-dual path-following interior point methods is considered the most successful" of the interior-point methods (which are the only major competitors to the simplex method for solving general linear programs).

