The asymptotic optimal partition and extensions of the nonsubstitution theorem

DOI10.1016/j.laa.2004.05.018zbMath1062.90034MaRDI QIDQ1765893

Jeffrey L. Stuart, Julio-Roberto Hasfura-Buenaga, Allen G. Holder

Publication date: 23 February 2005

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2004.05.018

zbMATH Keywords

Mathematical economics; Nonsubstitution theorem; Analytic matrix theory; Asymptotic linear programming; Optimal partition

Mathematics Subject Classification ID

90C31: Sensitivity, stability, parametric optimization

90C05: Linear programming

91B38: Production theory, theory of the firm

Related Items

A NON-SUBSTITUTION THEOREM WITH NON-CONSTANT RETURNS TO SCALE AND EXTERNALITIES, Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Partitioning multiple objective optimal solutions with applications in radiotherapy design
• A generalized inverse method for asymptotic linear programming
• An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
• Asymptotic linear programming and policy improvement for singularly perturbed Markov decision processes
• Limiting behavior of weighted central paths in linear programming
• Linear programs dependent on a single parameter
• Analytic centers and repelling inequalities
• A canonical form for pencils of matrices with applications to asymptotic linear programs
• Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights
• An efficient basis update for asymptotic linear programming
• Limiting behavior of the affine scaling continuous trajectories for linear programming problems
• Asymptotic Linear Programming
• Matrix Sensitivity Analysis from an Interior Solution of a Linear Program
• The Dynamic Nonsubstitution Theorem
• Marginal And Parametric Analysis Of The Central Optimal Solution