Bi-objective capacitated transportation problem with bounds over distributions and requirement capacities

DOI10.1007/S40819-021-00989-5MaRDI QIDQ2114885zbMATH OpenOpenAlexFDO

Authors Sanchita Sharma, Shalini Arora

Publication date 15 March 2022

Published in International Journal of Applied and Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40819-021-00989-5

zbMATH Keywords

efficient solutionscapacitated transportation problembi-objective transportation problembounded rim conditions

Mathematics Subject Classification ID

Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Finding non-dominated solutions for bi-objective integer transportation problem
• An algorithm for solving fixed charge bi-criterion transportation problem with restricted flow
• Capacitated transportation problem with bounds on rim conditions
• A new algorithm for the transportation problem with capacity limitation
• An iterative solution technique to minimize the average transportation cost of capacitated transportation problem with bounds on rim conditions

Cites work

• scientific article; zbMATH DE number 3764592 (Why is no real title available?)
• scientific article; zbMATH DE number 486947 (Why is no real title available?)
• scientific article; zbMATH DE number 810516 (Why is no real title available?)
• scientific article; zbMATH DE number 3231710 (Why is no real title available?)
• A new algorithm for linear multiobjective programming problems with bounded variables
• Bottleneck capacitated transportation problem with bounds on rim conditions
• Capacitated transportation problem with bounds on rim conditions
• Capacitated two-stage time minimization transportation problem
• Capacitated two-stage time minimization transportation problem with restricted flow
• Determination of the efficient set in multiobjective linear programming
• Finding all efficient extreme points for multiple objective linear programs
• Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
• Mass transportation problems with capacity constraints
• Multi-objective capacitated transportation problem with mixed constraint: a case study of certain and uncertain environment
• Note—The Distribution Problem with Upper and Lower Bounds on the Node Requirements
• On a class of capacitated transportation problems
• Probabilistic Analysis of the Capacitated Transportation Problem
• Solving Bicriterion Mathematical Programs
• The Primal-Dual Method for Bounded Variables
• The enumeration of all efficient solutions for a linear multiple-objective transportation problem
• Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming

Cited in

(5)

• On a class of capacitated transshipment problems with bounds on rim conditions
• A capacitated biobjective location problem with uniformly distributed demands in the UAV‐supported delivery operation
• Capacitated transportation problem with bounds on rim conditions
• Bottleneck capacitated transportation problem with bounds on rim conditions
• Reshipments and overshipments in transportation problems with minimax objective

This page was built for publication: Bi-objective capacitated transportation problem with bounds over distributions and requirement capacities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114885)