“More(Same)-for-Less” Paradox In Minimal Cost Network Flow Problem

DOI10.1080/02331939508844073zbMATH Open0821.90043OpenAlexW2039274079MaRDI QIDQ4836764FDOQ4836764

Anju Gupta, Munish C. Puri

Publication date: 21 June 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939508844073

zbMATH Keywords

bounded variablesparadoxpostoptimality analysisminimal cost network flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15)

Cites Work

• A new polynomial-time algorithm for linear programming
• Polynomial algorithms in linear programming
• The transportation paradox
• The Prevalence of Paradoxes in Transportation Equilibrium Problems
• Sensitivity analysis of 0-1 multiterminal network flows
• The more-for-less paradox in linear programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Newton method for convex separable network flow problems
• Implementing an “exact” Newton method for separable convex transportation problems
• The tolerance approach to sensitivity analysis in network linear programming
• A paradox in linear fractional transportation problems with mixed constraints

Cited In (6)

• The distribution model the more for less (nothing) paradox and economies of scale and scope: some nonlinear extensions
• Goal programming, regulation and generalised economies of scale and scope.
• The distribution problem, the more for less (nothing) paradox and economies of scale and scope
• Flow constrained minimum cost flow problem
• On the more-for-less paradoxical situations in linear programs: A parametric optimization approach
• Framing, switching and preference reversals

This page was built for publication: “More(Same)-for-Less” Paradox In Minimal Cost Network Flow Problem

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