Abstract
Abstract A forward dynamic programming approach is utilized to find an algebraic representation for a polyhedron in objective space associated with a multiple objective transportation problem having k linear objectives. This polyhedron has the same efficient structure as the set of all feasible objective values, and moreover all of its vertices are efficient. The algebraic representation of this polyhedron is of the form {y ϵ R k : Hy ≧ Ua + Vd} , where the matrices H, U and V are independent of the vector a of availabilities and vector d of demands. The procedure is illustrated by the numerical example of Isermann [H. Isermann, “The enumeration of all efficient solutions for a linear multiple-objective transportation problem”, Naval Research Logistics Quarterly 26 (1979) 123–139].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
