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

DOI10.1080/02331939508844073MaRDI QIDQ4836764zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(6)

• 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
• 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.

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)