Iterative descent method for generalized Leontief model
From MaRDI portal
Publication:2057501
Abstract: In this paper we consider generalized Leontief model. We show that under certain condition the generalized Leontief model is solvable by iterative descent method based on infeasible interior point algorithm. We prove the convergence of the method from strictly positive starting point. A numerical example is presented to demonstrate the performance of the algorithm
Recommendations
- scientific article; zbMATH DE number 3928671
- Solvability results of a conditional input-output equation based on a type of nonlinear Leontief model
- Solving an analytic dynamic Leontief model with time dependent capital matrix
- An algorithm for the solution of the Showalter-Sidorov problem for Leont'ev-type models
- The generalized Leontief input-output model and its application to the choice of new technology
Cites work
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- A generalization of the linear complementarity problem
- A primal-dual infeasible-interior-point algorithm for linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- An Infeasible-Interior-Point Method for Linear Complementarity Problems
- Finiteness of Criss-Cross Method in Complementarity Problem
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
- Optimal Solution of a Dynamic Leontief Model with Substitution
- The generalized Leontief input-output model and its application to the choice of new technology
- The generalized linear complementarity problem revisited
This page was built for publication: Iterative descent method for generalized Leontief model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2057501)