Skip to main content
Log in

Studying the stability of solutions to systems of linear inequalities and constructing separating hyperplanes

  • Published:
Journal of Applied and Industrial Mathematics Aims and scope Submit manuscript

Abstract

We consider the methods for matrix correction or correction of all parameters of systems of linear equations and inequalities. We show that the problem of matrix correction of an inconsistent system of linear inequalities with the nonnegativity condition is reduced to a linear programming problem. Some stability measure is defined for a given solution to a system of linear inequalities as the minimal possible variation of parameters under which this solution does not satisfy the system. The problem of finding the most stable solution to the system is considered. The results are applied to constructing an optimal separating hyperplane in the feature space that is the most stable to the changes of features of the objects.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. O. S. Barkalova, “Correction of Improper Linear Programming Problems in Canonical Form by Applying the Minimax Criterion,” Zh. Vychisl. Mat. Mat. Fiz. 52(12), 2178–2189 (2012) [Comput. Math. Math. Phys. 52 (12), 1624–1634 (2012).

    MATH  Google Scholar 

  2. A. A. Vatolin, ”Correction of the Augmented Matrix of an Inconsistent System of Linear Inequalities and Equations,” in Mathematical Methods of Optimization in Economical-Mathematic Modeling (Nauka, Moscow, 1991), pp. 240–249.

    Google Scholar 

  3. V. A. Gorelik, “Matrix Correction of a Linear Programming Problem with an Inconsistent System of Constraints,” Zh. Vychisl. Mat. Mat. Fiz. 41(11), 1697–1705 (2001) [Comput. Math. Math. Phys. 41 (11), 1615–1622 (2001)].

    MathSciNet  Google Scholar 

  4. V. A. Gorelik, V. I. Erokhin, and R. V. Pechenkin, “Optimal Matrix Correction of Incompatible Systems of Linear Algebraic Equations with Block Matrices of Coefficients,” Diskretn. Anal. Issled. Oper. Ser. 2. 12(2), 3–23 (2005).

    MATH  MathSciNet  Google Scholar 

  5. V. A. Gorelik, V. I. Erokhin, and R. V. Pechenkin, Numerical Methods for the Correction of Improper Linear Programming Problems and Structured Systems of Equations (Dorodnitsyn Computing Center of the Russian Academy of Sciences, Moscow, 2006) [in Russian].

    Google Scholar 

  6. V. A. Gorelik, V. I. Erokhin, and R. V. Pechenkin, “Minimax Matrix Correction of Inconsistent Systems of Linear Algebraic Equations with Block Matrices of Coefficients,” Izv. Ross. Akad. Nauk, Teor. Sist. Upravl. No. 5, 52–62 (2006) [J. Comput. Syst. Sci. Int. 45 (5), 727–737 (2006)].

    Google Scholar 

  7. V. A. Gorelik, I. A. Zoltoeva, and R. V. Pechenkin, “Correction Methods for Incompatible Linear Systems with Sparse Matrices,” Diskretn. Anal. Issled. Oper. Ser. 2. 14(2), 62–75 (2007).

    MATH  MathSciNet  Google Scholar 

  8. V. A. Gorelik and R. R. Ibatullin, “Correction of a System of Constraints of a Linear Programming Problem with a Minimax Constraint,” in Modeling, Decomposition, and Optimization of Complex Dynamic Processes (Dorodnitsyn Computing Center of the Russian Academy of Sciences, Moscow, 2001), pp. 89–107.

    Google Scholar 

  9. V. A. Gorelik and O. V. Murav’eva, “Necessary and Sufficient Conditions for the Existence of a Minimal Matrix in the Problem of the Correction of an Incompatible System of Linear Equations,” in Modeling, Decomposition, and Optimization of Complex Dynamic Processes (Dorodnitsyn Computing Center of the Russian Academy of Sciences, Moscow, 2001), pp. 14–20.

    Google Scholar 

  10. I. I. Eremin, V. D. Mazurov, and N. N. Astaf’ev, Improper Problems of Linear and Convex Programming (Nauka, Moscow, 1983) [in Russian].

    Google Scholar 

  11. O. V. Murav’eva, “Correction and Perturbation of Systems of Linear Inequalities,” Upravlenie Bol’shimi Sistemami, No. 28, 40–57 (2010).

    Google Scholar 

  12. O. V. Murav’eva, “Robustness and Correction of Linear Models,” Avtomat. i Telemekh. No. 3, 98–112 (2011) [Automat. Remote Control 72 (3), 556–569 (2011)].

    Google Scholar 

  13. M. Fiedler, J. Nedoma, J. Ramik, J. Rohn, and K. Zimmermann, Linear Optimization Problems with Inexact Data (Springer, New York, 2006; Regular and Chaotic Dynamics, Izhevsk, 2008).

    MATH  Google Scholar 

  14. C. Cortes C. and V. Vapnik, “Support Vector Networks,” Machine Learning 20(3), 273–297 (1995).

    MATH  Google Scholar 

  15. A. Ben-Tal, L. El Ghaoui, and A. Nemirovski, Robust Optimization (Princeton Univ. Press, Princeton, 2009).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to O. V. Murav’eva.

Additional information

Original Russian Text © O.V. Murav’eva, 2014, published in Diskretnyi Analiz i Issledovanie Operatsii, 2014, Vol. 21, No. 3, pp. 53–63.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Murav’eva, O.V. Studying the stability of solutions to systems of linear inequalities and constructing separating hyperplanes. J. Appl. Ind. Math. 8, 349–356 (2014). https://doi.org/10.1134/S1990478914030065

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Navigation