Complexity of computing the worst optimal value of interval transportation problems

DOI10.1007/S10100-024-00947-8MaRDI QIDQ6953396zbMATH OpenFDO

Authors Elif Garajová, Miroslav Rada

Publication date 24 July 2025

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

Full work available at URL https://doi.org/10.1007/S10100-024-00947-8

zbMATH Keywords

interval dataoptimal valuetransportation problemuncertainty

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A fuzzy approach to the transportation problem
• A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies
• A Stochastic Transportation Problem
• scientific article; zbMATH DE number 3272833 (Why is no real title available?)
• Interval linear programming under transformations: optimal solutions and optimal value range
• Interval transportation problem: feasibility, optimality and the worst optimal value
• Linear Optimization Problems with Inexact Data
• On strong optimality of interval linear programming
• On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows
• Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
• Perspectives of Monge properties in optimization
• Strong optimal solutions of interval linear programming
• The distribution of a product from several sources to numerous localities.
• The more-for-less paradox in linear programming
• The optimal solution set of the interval linear programming problems
• The transportation paradox
• The worst case finite optimal value in interval linear programming
• Validated numerics. A short introduction to rigorous computations.
• Which matrices are immune against the transportation paradox?

Cited in

(2)

• Recent theoretical and practical contributions to the or environment and CEJOR from the perspective of SSI-SOR
• An iterative solution approach to capacitated two-stage time minimization transportation problem with destination-stage demand specified

This page was built for publication: Complexity of computing the worst optimal value of interval transportation problems

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