Interactive solutions for the linear multiobjective transportation problem (Q1091276)

Mathematical programming problems that exhibit the mathematical structure of a transportation problem often arise in settings with multiple conflicting objectives. Existing procedures for analyzing these fall into two general categories. These methods either generate all nondominated solutions or they construct a single compromise solution. This paper presents two interactive algorithms which take advantage of the special form of the multiple objective transportation problem. Two examples are included to illustrate these algorithms and to demonstrate their viability.