A new local and global optimization method for mixed integer quadratic programming problems (Q606807)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5817340
Language Label Description Also known as
default for all languages
No label defined
    English
    A new local and global optimization method for mixed integer quadratic programming problems
    scientific article; zbMATH DE number 5817340

      Statements

      A new local and global optimization method for mixed integer quadratic programming problems (English)
      0 references
      0 references
      0 references
      0 references
      18 November 2010
      0 references
      The authors consider the following mixed integer quadratic optimization problem with box constraints \[ \min f(x)= {1\over 2} x^T Ax+ a^T x,\quad x\in\mathbb{R}^n, \] \[ \text{s.t. }x\in U:= \{(x_1,\dots, x_n)^T|^{x_i\in \{u_i+1,\dots, v_i\}, i\in I}_{x_i\in [u_i, v_i],\;i\in J}\} \] and present a new local and global optimization method by using optimality conditions. Numerical experiments are given and show that the new approach is effective and stable.
      0 references
      0 references
      mixed integer quadratic programming problem
      0 references
      optimization method
      0 references
      global optimality condition
      0 references
      auxiliary function
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references