Skip to main content
SpringerLink
Log in

New Approaches to Solving Discrete Programming Problems on the Basis of Lexicographic Search

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

New approaches are proposed to the solution of discrete programming problems on the basis of searching for lexicographic vector ordering for which the optimal solution to a problem coincides with the lexicographic extremum of the set of feasible solutions of the problem or is located rather close to it in the lexicographic sense. A generalized scheme of this lexicographic search and possibilities of its modification are described. Considerable advantages of this approach over the standard lexicographic search algorithm in efficiency are illustrated.

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. I. V. Sergienko and V. P. Shilo, Discrete Optimization Problems: Challenges, Solution Methods, and Investigations [in Russian], Naukova Dumka, Kyiv (2003).

    Google Scholar 

  2. Yu. Yu. Chervak, Optimization: Unimprovable Choice [in Ukrainian], UzhNU, Uzhhorod (2002).

    Google Scholar 

  3. S. V. Chupov, “Stochastic algorithm for lexicographic search for the solution of the Boolean knapsack problem,” in: Proc. VIIth Intern. School-Seminar “Decision Theory,” UzhNU, Uzhhorod (2014), pp. 263–264.

  4. S. V. Chupov, “Structural properties of a set specified in different orders,” in: Proc. IVth Intern. School-Seminar “Decision Theory,” UzhNU, Uzhhorod (2008).

  5. S. V. Chupov, “Lexicographic maximum of convex compacts and algebraic operations over them,” in: Proc. Intern. Conf. “Prediction and decision making under uncertainty,” (PDMU–2001), Publishing Center “University of Kyiv,” Kyiv (2001), pp. 138–139.

  6. S. V. Chupov, “Algorithm for searching for the integer lexicographic maximum of a set,” Scientific Herald of Uzhhorod National University, Ser. Mathematics, No. 2, 122–123 (1997).

  7. Yu. Yu. Chervak, V. I. Grendza, and S. V. Chupov, “Lexicographic optimization in discrete programming,” in: Intern. Conf. “Problems of optimization of computations,” Trans. of NAS of Ukraine, V. M. Glushkov Institute of Cybernetics, Kyiv (1997), pp. 317–319.

Download references

Author information

Authors and Affiliations

  1. Uzhhorod National University, Uzhhorod, Ukraine

    S. V. Chupov

Authors
  1. S. V. Chupov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. V. Chupov.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 4, July–August 2016, pp. 43–54.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chupov, S.V. New Approaches to Solving Discrete Programming Problems on the Basis of Lexicographic Search. Cybern Syst Anal 52, 536–545 (2016). https://doi.org/10.1007/s10559-016-9855-9

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-016-9855-9

Keywords

Search

Navigation