scientific article; zbMATH DE number 3887432

zbMATH Open0556.90054MaRDI QIDQ3220089FDOQ3220089

Authors: Jay E. Aronson, G. L. Thompson 

Publication date: 1984

Title of this publication is not available (Why is that?)

Recommendations

• A Forward Simplex Method for Staircase Linear Programs
• A forward convex-simplex method
• A forward network simplex algorithm for solving multiperiod network flow problems
• Fast Solution and Detection of Minimal Forecast Horizons in Dynamic Programs with a Single Indicator of the Future: Applications to Dynamic Lot-Sizing Models
• scientific article; zbMATH DE number 3916016

zbMATH Keywords

network flowoptimal controlForward algorithmsdecision horizondecomposition of a multiperiod problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Decomposition methods (49M27)

Cited In (9)

• A forward maximum principle algorithm with decision horizon results
• A Forward Simplex Method for Staircase Linear Programs
• Solving a class of network models for dynamic flow control
• Title not available (Why is that?)
• A survey of dynamic network flows
• A forward network simplex algorithm for solving multiperiod network flow problems
• Extending and solving a multiperiod congested network flow model
• A theory of rolling horizon decision making
• A forward convex-simplex method

This page was built for publication:

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