Abstract
Examples of homogeneous linear programming problems are investigated. The objective function of such a problem is not bounded below on a feasible set. A starting point is presented such that the affine scaling method generates a sequence of vectors that converges to zero.
Similar content being viewed by others
References
W. F. Mascarenhas, “The affine scaling algorithm fails for step size 0.999,” Siam J. Optim., 7, No. 1, 34–46 (1997).
T. Terlaky and T. Tsuchiya, “A note on Mascarenhas’ counterexample about convergence of the affine scaling algorithm fail,” Appl. Math. and Optim., 40, 287–314 (1999).
I. I. Dikin, “Determining the interior point of a system of linear inequalities,” Kibern. Sist. Anal., No. 1, 67–74 (1992).
R. Saigal, Linear Programming: A Modern Integrated Analysis, Kluwer, Dordrecht (1996).
T. Tsuchiya, “Affine scaling algorithm,” in: T. Terlaky (ed.), Interior Point Methods of Mathematical Programming, Kluwer, Dordrecht (1996), pp. 35–82.
I. I. Dikin, Determination of Feasible and Optimal Solutions by the Affine Scaling Method [in Russian], Sib. Otdel. RAN, Nauka, Novosibirsk (1998).
Author information
Authors and Affiliations
Additional information
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 178–179, January–February 2006.
Rights and permissions
About this article
Cite this article
Dikin, I.I. Examples in the theory of convergence of the affine scaling method. Cybern Syst Anal 42, 157–158 (2006). https://doi.org/10.1007/s10559-006-0048-9
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10559-006-0048-9