Interval transportation problem: feasibility, optimality and the worst optimal value

DOI10.1007/s10100-023-00841-9arXiv2301.12785OpenAlexW4321231504MaRDI QIDQ6166938

Miroslav Rada, Elif Garajová

Publication date: 4 August 2023

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.12785

zbMATH Keywords

transportation probleminterval programmingoptimal value

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

60 years of OR in Slovenia: development from a first conference to a vibrant community

Cites Work

• A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies
• On strong optimality of interval linear programming
• On the optimal solution set in interval linear programming
• Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
• Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
• Zur lösung linearer ungleichungssysteme bei störimg der rechten seite und der koeffizientenmatrix
• The Worst Case Finite Optimal Value in Interval Linear Programming
• Linear Optimization Problems with Inexact Data
• The transportation paradox
• On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows

This page was built for publication: Interval transportation problem: feasibility, optimality and the worst optimal value