A canonical form for pencils of matrices with applications to asymptotic linear programs
From MaRDI portal
Publication:1908190
Recommendations
- scientific article; zbMATH DE number 1908189
- A generalized inverse method for asymptotic linear programming
- An efficient basis update for asymptotic linear programming
- An asymptotic simplex method for singularly perturbed linear programs
- scientific article; zbMATH DE number 3987052
- A method of solving the general problem of linear programming
- scientific article; zbMATH DE number 3858841
- Influence of fluid therapy on the haemostatic system of intensive care patients
- scientific article; zbMATH DE number 19340
- Publication:3484647
Cites work
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3658896 (Why is no real title available?)
- scientific article; zbMATH DE number 3772856 (Why is no real title available?)
- A generalized inverse method for asymptotic linear programming
- An efficient basis update for asymptotic linear programming
- An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
- Applications of the Drazin Inverse to Linear Systems of Differential Equations with Singular Constant Coefficients
- Discrete Dynamic Programming
- Discrete Dynamic Programming with Sensitive Discount Optimality Criteria
- Discrete Dynamic Programming with a Small Interest Rate
- Hierarchical algorithms for discounted and weighted Markov decision processes
- Linear Programming in O([n3/ln n]L) Operations
- Matrix pencils. Proceedings of a Conference Held at Pite Havsbad, Sweden, March 22-24, 1982
- Multiplicative Markov Decision Chains
- Normalized Markov Decision Chains I; Sensitive Discount Optimality
- Singulary perturbed Markov control problem: Limiting average cost
- The Laurent expansion of pencils that are singular at the origin
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
- Time-invariant descriptor systems
Cited in
(17)- scientific article; zbMATH DE number 1908189 (Why is no real title available?)
- Least squares {\(\eta\)}-bi-Hermitian problems of the quaternion matrix equation \((AXB,CXD) = (E,F)\)
- Least squares solution of the quaternion matrix equation \(X-A\hat{X}B=C\) with the least norm
- On Hermitian solutions of the split quaternion matrix equation \(AXB+CXD=E\)
- On the general solutions to some systems of quaternion matrix equations
- On Hermitian solutions of the reduced biquaternion matrix equation \((AXB, CXD) = (E, G)\)
- A quaternion matrix equation with two different restrictions
- Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem
- An asymptotic simplex method for singularly perturbed linear programs
- Consistency of split quaternion matrix equations \(AX^{\star }-XB=CY+D\) and \(X-AX^\star B=CY+D\)
- L-structured quaternion matrices and quaternion linear matrix equations
- Explicit solutions to the quaternion matrix equations \(X- AXF=C\) and \(X-A\tilde X F=C\)
- On the Kronecker Canonical Form of Singular Mixed Matrix Pencils
- The asymptotic optimal partition and extensions of the nonsubstitution theorem
- An iterative algorithm to solve the generalized Sylvester tensor equations
- scientific article; zbMATH DE number 4077659 (Why is no real title available?)
- Least-squares problem for the quaternion matrix equation \(AXB+CYD=E\) over different constrained matrices
This page was built for publication: A canonical form for pencils of matrices with applications to asymptotic linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908190)
