Skip to main content
Log in

Use of barrier functions for optimal correction of improper problems of linear programming of the 1st kind

  • Linear and Nonlinear Programming Problems
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

Possibilities are investigated of the combined use of interior and exterior penalty functions for discovering the generalized (approximate) solutions of improper problems of linear programming of the 1st kind. Diagrams of algorithms, theorems of convergence, results of numerical experiments are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Eremin, I.I., Duality for Improper Problems of Linear and Convex Programming, Dokl. Akad. Nauk SSSR, 1981, vol. 256, no. 2, pp. 272–276.

    MathSciNet  Google Scholar 

  2. Eremin, I.I., Mazurov, Vl.D., and Astafiev, N.N., Nesobstvennye zadachi lineinogo i vypuklogo programmirovaniya (Improper Problems of Linear and Convex Programmming), Moscow: Nauka, 1983.

    Google Scholar 

  3. Eremin, I.I., Protivorechivye modeli optimal’nogo planirovaniya (Contradictory Models of Optimal Planning), Moscow: Nauka, 1988.

    MATH  Google Scholar 

  4. Morozov, V.A., On Pseudosolutions, Zh. Vychisl. Mat. Mat. Fiz., 1969, vol. 9, no. 6, pp. 1387–1391.

    MATH  Google Scholar 

  5. Kochikov, I.V., Matvienko, A.N., and Yagola, A.G., Generalized Principle of the Residual for Solution of Incompatible Equations, Zh. Vychisl. Mat. Mat. Fiz., 1984, vol. 24, no. 7, pp. 1087–1090.

    MathSciNet  MATH  Google Scholar 

  6. Issledovaniya po nesobstvennym zadacham optimizatsii: sb. statei (Investigations on Improper Problems of Optimization: Collection of Works), Sverdlovsk: UrO Akad. Nauk SSSR, 1988.

  7. Parametricheskaya optimizatsiya i metody approksimatsii nesobstvennykh zadach matematicheskogo programmirovaniya: sb. statei (Parametric Optimization and Methods of Approximation of the Improper Problems of Mathematical Programming: Collection of Works), Sverdlovsk: UNTs Akad. Nauk SSSR, 1985.

  8. Neregulyarnaya dvoistvennost’ v matematicheskom programmirovanii: sb. statei (Irregular Duality in Mathematical Programming: Collextion of Works), Sverdlovsk: UrO Akad. Nauk SSSR, 1990.

  9. Popov, L.D., Application of the Modified Method for Optimal Correction of Improper Problems of Convex Programming, Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk, 1995, vol. 3, pp. 261–266.

    MATH  Google Scholar 

  10. Popov, L.D., Symmetric Systems and Fejer Processes for Improper Problems of Linear Programming, Methods of Optimization and Their Applications: Proc. XIII Intern. Baikal. Sch. Seminar (ISEM SO Ross. Akad. Nauk), Irkutsk, 2005, vol. 1, pp. 141–146.

    Google Scholar 

  11. Skarin, V.D., On the Method of Barrier Functions and Algorithms for Correction of Improper Problems of Convex Programming, Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk, 2008, vol. 14, no. 2, pp. 115–128.

    MathSciNet  Google Scholar 

  12. Fiacco, A.V. and McCormick, G.P, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, New York: Wiley, 1968. Translated under the title Nelineinoe programmirovanie. Metody posledovatel’noi bezuslovnoi minimizatsii, Moscow: Mir, 1972.

    MATH  Google Scholar 

  13. Roos, C., Terlaky, T., and Vial, J.-Ph., Theory and Algorithms for Linear Optimization, Chichester: Wiley, 1997.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Original Russian Text © L.D. Popov, 2012, published in Avtomatika i Telemekhanika, 2012, No. 3, pp. 3–11.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Popov, L.D. Use of barrier functions for optimal correction of improper problems of linear programming of the 1st kind. Autom Remote Control 73, 417–424 (2012). https://doi.org/10.1134/S0005117912030010

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117912030010

Keywords

Navigation