Polynomial goal programming: A procedure for modeling preference trade-offs

This paper develops an approach for a generalized goal programming model and solution technique, which will permit trade-offs between preference levels, while retaining the flexibility to model intra-level preferences. The Polynomial Goal Programming (PGP) model accommodates both intra-level and inter-level preference trade-offs via the specification of the objective function as a polynomial expression. A comparative example demonstrates the enhanced modeling capability of the PGP approach in contrast to the more traditional linear and quadratic preemption models.