Cybernetics and Systems Analysis

, Volume 41, Issue 6, pp 932–935 | Cite as

Functionally redundant constraints for Boolean quadratic-type optimization problems

  • P. I. Stetsyuk
Brief Communications


A method of construction of functionally redundant quadratic constraints is proposed for Boolean quadratic-type optimization problems. The method is based on an extension of a set of Boolean variables and formation of functionally redundant constraints that relate the initial and added variables. Examples of improvement of Lagrangian dual quadratic estimates obtained by using the constructed redundant constraints are given.


quadratic-type optimization problem Lagrangian dual quadratic estimate functionally redundant quadratic constraint 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    N. Z. Shor, Nondifferentiable Optimization and Polynomial Problems, Kluwer, Dordrecht (1998).Google Scholar
  2. 2.
    N. Z. Shor, “Role of redundant constraints for improving dual bounds in polynomial optimization problems,” Kibern. Sist. Anal., No. 4, 106–121 (1998).Google Scholar
  3. 3.
    N. Z. Shor and P. I. Stetsyuk, “Lagrangian bounds in multiextremal polynomial and discrete optimization problems,” Journ. of Global Optimiz., 23, 1–41 (2002).MathSciNetGoogle Scholar
  4. 4.
    N. Z. Shor and P. I. Stetsyuk, “Dual solution of quadratic-type problems by the r-algorithm (subroutine DSQTPr),” in: Abstr. 2nd Intern. Workshop “Recent Advances in Non-Differentiable Optimization” (October 1–4, 2001, Kyiv, Ukraine) (2001), p. 36.Google Scholar

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  • P. I. Stetsyuk
    • 1
  1. 1.V. M. Glushkov Cybernetics InstituteNational Academy of Sciences of UkraineKievUkraine

Personalised recommendations