Bicriteria Transportation Problem

From MaRDI portal
Publication:3885513


DOI10.1287/mnsc.25.1.73zbMath0442.90056MaRDI QIDQ3885513

K. P. K. Nair, Yash P. Aneja

Publication date: 1979

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.25.1.73


90C31: Sensitivity, stability, parametric optimization

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)


Related Items

Analytic efficient solution set for bi-criteria quadratic network programs, Maximizing residual flow under an arc destruction, Time-cost Trade-off Relations in Bulk Transportation Problem, An algorithm for the biobjective integer minimum cost flow problem, A dynamic transportation model with multiple criteria and multiple constraint levels, The biobjective undirected two-commodity minimum cost flow problem, On trade-off solution pairs in a special type of transportation problem, Multiple objective minimum cost flow problems: a review, The maximum covering/shortest path problem: A multiobjective network design and routing formulation, On efficient sets in vector maximum problems - A brief survey, On a class of quadratic programs, Interactive solutions for the linear multiobjective transportation problem, Minmax combinatorial optimization, Bicriteria linear fractional programming, An algorithm for bicriterion linear programming, Efficiency and time-cost-tradeoffs in transportation problems, Bicriteria network flow problems: Continuous case, Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine, A note on solving bicriteria linear programming problems using single criteria software, The convergence rate of the sandwich algorithm for approximating convex functions, A bicriterion framework for operations assignment and routing flexibility analysis in cellular manufacturing systems, Efficient solutions for the bicriteria network flow problem, Bicriteria network flow problems: Integer case, Fuzzy bicriteria multi-index transportation problems for coal allocation planning of Taipower, A method for convex curve approximation, A variation of the assignment problem, Fuzzy programming approach to multicriteria decision making transportation problem, Fuzzy programming approach to multiobjective solid transportation problem, Optimization over the efficient set: Four special cases, Constructing the set of efficient objective values in linear multiple objective transportation problems, An algorithm for the committee construction problem, On bicriterion minimal spanning trees: An approximation, The biobjective minimum cost flow problem, Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, Three algorithms for bicriteria integer linear programs, A transportation model with multiple criteria and multiple constraint levels, Parametric min-cuts analysis in a network., Scheduling unit processing time jobs on a single machine with multiple criteria, Approximation of convex curves with application to the bicriterial minimum cost flow problem, The multiple objective time transportation problem with additional restrictions, Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, \(\varepsilon\)-approximation minimization of convex functions in fixed dimension, Two phase algorithms for the bi-objective assignment problem, An algorithm for a fuzzy transportation problem to select a new type of coal for a steel manufacturing unit, Multiobjective modelling and analysis of process planning in a manufacturing system, Applying interactive fuzzy multi-objective linear programming to transportation planning decisions, INTERACTIVE MULTI-OBJECTIVE TRANSPORTATION PLANNING DECISIONS USING FUZZY, LINEAR PROGRAMMING, Bicriteria bottleneck linear programming problem, A note on bi-criteria transportation problems, Sandwich approximation of univariate convex functions with an application to separable convex programming, Total shipping cost/completion-date trade-off in transportation problem with additional restriction