Interactive solutions for the linear multiobjective transportation problem

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 problems fall into two general categories. These methods either generate all nondominated soluti...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 1987-10, Vol.32 (1), p.96-106
Main Authors: Ringuest, Jeffrey L., Rinks, Dan B.
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Exact sciences and technology
general transportation
Linear programming
Mathematical analysis
Mathematical models
Mathematical programming
Multiple
Multiple criteria
Objectives
Operational research and scientific management
Operational research. Management science
Operations research
Transportation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 problems 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.
ISSN:0377-2217
1872-6860
DOI:10.1016/0377-2217(87)90274-8