Constructing the set of efficient objective values in linear multiple objective transportation problems
From MaRDI portal
Publication:1328608
DOI10.1016/0377-2217(94)90154-6zbMath0826.90097MaRDI QIDQ1328608
Ossama A. Saleh, Richard J. Gallagher
Publication date: 23 November 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90154-6
90C29: Multi-objective and goal programming
90C05: Linear programming
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
90C39: Dynamic programming
Related Items
A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program, A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multi-criteria simplex method for a linear multiple-objective transportation problem
- Constructing the set of efficient objective values in multiple objective linear programs
- Interactive solutions for the linear multiobjective transportation problem
- Analysis of the objective space in multiple objective linear programming
- A representation of the set of feasible objectives in multiple objective linear programs
- A new algorithm to find all vertices of a polytope
- Computational results on an algorithm for finding all vertices of a polytope
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- Bicriteria Transportation Problem
- Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems
- Technical Note—Cost/Completion-Date Tradeoffs in the Transportation Problem
- The enumeration of all efficient solutions for a linear multiple-objective transportation problem
