Skip to main content

Advertisement

SpringerLink
Log in

Trapezoid method for solving systems of linear inequalities and its implementation in insertion modeling

  • SOFTWARE–HARDWARE SYSTEMS
  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

A new method for solving systems of linear inequalities (trapezoid method) is developed. The method involves constructing canonical forms of a system of linear inequalities. Canonical forms represent a partition of the convex polyhedron of solutions of the system into a union of disjoint trapezoids. The result of using this method is a set of basis vectors of the polyhedron of solutions. An insertion model of the algorithm is presented.

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

Access this article

Log in via an institution

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. M. S. Lvov, “Algebraic approach to the problem of solving systems of linear inequalities,” Cybernetics and Systems Analysis, 46, No. 2, 326–338 (2010).

    Article  MathSciNet  MATH  Google Scholar 

  2. J. Goguen and J. Meseguer, “Ordered-sorted algebra I: Partial and Overloaded Operations, Errors and Inheritance,” Computer Science, 105, No. 2, 217–273 (1992).

    MathSciNet  MATH  Google Scholar 

  3. J. A. Goguen, J. W. Thatcher, and E. Wagner, “An initial algebra approach to the specification, correctness and implementation of abstract data types,” in: R. Yeh (ed.), Current Trends in Programming Methodology, Prentice Hall, NJ (1978), pp. 80–149.

    Google Scholar 

  4. M. S. Lvov, “Synthesis of interpreters of algebraic operations in extensions of multisorted algebras,” Visn. Khark. Nats. Un-tu, No. 847, 221–238 (2009).

  5. M. S. Lvov, “Verification of interpreters of algebraic operations in extensions of multisorted algebras,” KhUPS, No. 3(21), 127–137 (2009).

  6. M. S. Lvov, “Method of inheritance in implementing algebraic computations in mathematical systems of educational destination,” Syst. Upravl., Navigats. 3 Zv’yazku, TsNDINiU, No. 3 (11), 120–130, (2009).

  7. M. S. Lvov, “Method of morphisms in implementing algebraic computations in mathematical systems of educational destination,” Systemy Obrobky Informatsii, No. 6 (80), 183–190 (2009).

  8. M. S. Lvov, “An approach to the implementation of algebraic computations: Computations in propositional algebra,” Visn. Khark. Nats. Un-tu, Information Technologies: Mathematical Modeling, No. 863, 157–168 (2009).

  9. T. S. Motzkin, H. Raiffa, G. L. Thompson, and R. M. Thrall “The double description method” in: Matrix Games, Fizmatgiz, Moscow (1961), pp. 81–109.

    Google Scholar 

  10. G. L. Zeidler, Lectures on Convex Polytopes, Springer, Berlin–New York (1994).

    Google Scholar 

  11. S. N. Tchernikov, Linear Inequalities [in Russian], Nauka, Moscow (1968).

    Google Scholar 

  12. A. Letichevsky, J. Kapitonova, V. Volkov, V. Vyshemirskii, and A. Letichevsky Jr., “Insertion programming,” Cybernetics and System Analysis, 39, No. 1, 16–26 (2003).

    Article  Google Scholar 

  13. A. A. Letichevsky, J. V. Kapitonova, and S. V. Konozenko, “Algebraic programming system APS-1,” in: Proc. of the Soviet-French Symp. INFORMATICS’-89, Tallin (1989), pp. 46–55.

  14. http://www.icyb.kiev.ua.

  15. http://www.ksu.ks.ua.

  16. A. Ad. Letichevsky, Yu. V. Kapitonova, V. F. Volkov, at al., “Systems specification by basic protocols,” Cybernetics and Systems Analysis, 41, No. 4, 479–493 (2005).

    Article  MathSciNet  MATH  Google Scholar 

  17. Methodical Software Complex Term VII for Supporting Practical Mathematical Activities, http://riit.ksu.ks.ua/index.php?q=ru/node/229.

  18. APS & IMS, http://www.apsystem.org.ua.

  19. D. Park, “Concurrency and automata on infinite sequences,” LNCS, 104, 167–183 (1981).

    Google Scholar 

  20. A. Letichevsky, “Algebra of behavior transformations and its applications,” in: V. B. Kudryavtsev and I. G. Rosenberg (eds.), Structural Theory of Automata, Semigroups, and Universal Algebra, NATO Science Series II, Mathematics, Physics and Chemistry, 207 (2005), pp. 241–272.

  21. V. S. Peschanenko, “An approach to designing algebraic data types,” Problemy Programmuvannya, Nos. 2–3, 626–634 (2006).

Download references

Author information

Authors and Affiliations

  1. Kherson State University, Kherson, Ukraine

    M. S. Lvov & V. S. Peschanenko

Authors
  1. M. S. Lvov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. S. Peschanenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to M. S. Lvov or V. S. Peschanenko.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 144–156, November–December 2012.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lvov, M.S., Peschanenko, V.S. Trapezoid method for solving systems of linear inequalities and its implementation in insertion modeling. Cybern Syst Anal 48, 931–942 (2012). https://doi.org/10.1007/s10559-012-9475-y

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-012-9475-y

Keywords

Search

Navigation