On abstract duality in mathematical programming

It is shown that duality in mathematical programming can be treated as a purely order theoretic concept which leads to some applications in economics. Conditions for strong duality results are given. Furthermore the underlying sets are endowed with (semi-)linear structures, and the perturbation function of arising linear and integer problems, which include bottleneck problems and extremal problems (in the sense of K. Zimmermann), is investigated.