A generalized inverse method for asymptotic linear programming

DOI10.1007/BF01582279MaRDI QIDQ1122475zbMATH OpenOpenAlexFDO

Authors Bernard F. Lamond

Publication date 1989

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01582279

zbMATH Keywords

Laurent expansionexpansionsDrazin generalized inverseasymptotic linear programming

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Linear programming (90C05) Series expansions (e.g., Taylor, Lidstone series, but not Fourier series) (41A58)

Recommendations

• An efficient basis update for asymptotic linear programming
• Linear time algorithms for linear programming
• An asymptotic simplex method for singularly perturbed linear programs
• A method of solving the general problem of linear programming
• Linear Programming in O([n3/ln n]L) Operations

Cites work

• scientific article; zbMATH DE number 3928750 (Why is no real title available?)
• scientific article; zbMATH DE number 3772856 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• An Efficient Factorization for the Group Inverse
• Applications of the Drazin Inverse to Linear Systems of Differential Equations with Singular Constant Coefficients
• Asymptotic Linear Programming
• Discrete Dynamic Programming
• Discrete Dynamic Programming with Sensitive Discount Optimality Criteria
• Generalized Inverses in Discrete Time Markov Decision Processes
• Pseudo-Inverses in Associative Rings and Semigroups
• Resolvent expansions of matrices and applications

Cited in

(9)

• An efficient basis update for asymptotic linear programming
• Inexact linear programming with generalized technological matrix sets
• A canonical form for pencils of matrices with applications to asymptotic linear programs
• Applications of generalized inverses to interval linear programs in hilbert spaces
• An asymptotic simplex method for singularly perturbed linear programs
• Markov branching decision chains with interest-rate-dependent rewards
• Laurent expansion of the inverse of perturbed, singular matrices
• A further study on inverse linear programming problems
• The asymptotic optimal partition and extensions of the nonsubstitution theorem

This page was built for publication: A generalized inverse method for asymptotic linear programming

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