A barrier method for dynamic Leontief-type linear programs

DOI10.1016/0377-2217(92)90081-JzbMath0762.90055OpenAlexW2095337612MaRDI QIDQ1199511

Wei-Shi Hwang, Eugene K. Yang

Publication date: 16 January 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90081-j

zbMATH Keywords

Leontief-type constraintsprojected Newton barrier method

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Multisectoral models in economics (91B66) Economic growth models (91B62) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• An analysis of an available set of linear programming test problems
• A Linear Programming Solution to Dynamic Leontief type Models
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• Computational experience with advanced implementation of decomposition algorithms for linear programming
• The Efficiency of the Simplex Method: A Survey
• A set of staircase linear programming test problems
• A Partioning Technique for Leontief Type Linear Programming Production Models

This page was built for publication: A barrier method for dynamic Leontief-type linear programs