The asymptotic optimal partition and extensions of the nonsubstitution theorem

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

Julio-Roberto Hasfura-Buenaga, Jeffrey L. Stuart, 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 economicsNonsubstitution theoremAnalytic matrix theoryAsymptotic linear programmingOptimal partition

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Production theory, theory of the firm (91B38)

Related Items (2)

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

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

This page was built for publication: The asymptotic optimal partition and extensions of the nonsubstitution theorem