A simplex algorithm for network flow problems with piecewise linear fractional objective function

DOI10.1007/s12597-009-0024-zzbMath1202.90043OpenAlexW1998488507MaRDI QIDQ1956474

Pooja Pandey, Abraham P. Punnen

Publication date: 22 September 2010

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-009-0024-z

Mathematics Subject Classification ID

Fractional programming (90C32) Deterministic network models in operations research (90B10) Extreme-point and pivoting methods (90C49)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A simplex algorithm for piecewise-linear fractional programming problems
• A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
• A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
• A polynomial time primal network simplex algorithm for minimum cost flows
• Linear-fractional programming. Theory, methods, applications and software.
• Some special situations in linear fractional programming problem: An algorithmic comparison
• Upper bound problem in linear fractional functionals programming
• Recent Advances in Linear Programming
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• A paradox in linear fractional transportation problems with mixed constraints
• Bibliography in fractional programming
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Extreme point linear fractional functional programming
• Programming with linear fractional functionals
• Letter to the Editor—Linear Fractional Functionals Programming
• Fractional programming

This page was built for publication: A simplex algorithm for network flow problems with piecewise linear fractional objective function