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

DOI10.1080/02331939508844073zbMath0821.90043OpenAlexW2039274079MaRDI QIDQ4836764

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

paradoxbounded variablespostoptimality analysisminimal cost network flow

Mathematics Subject Classification ID

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

Related Items (6)

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

Cites Work

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

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