A new linearization technique for multi-quadratic 0–1 programming problems
✍ Scribed by Wanpracha Chaovalitwongse; Panos M Pardalos; Oleg A Prokopyev
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 205 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
✦ Synopsis
We consider the reduction of multi-quadratic 0-1 programming problems to linear mixed 0-1 programming problems. In this reduction, the number of additional continuous variables is O(kn) (n is the number of initial 0-1 variables and k is the number of quadratic constraints). The number of 0-1 variables remains the same.
📜 SIMILAR VOLUMES
In this paper, we focus on the quadratic cost 01 mixed integer programming problem. First, we formulate the problem as a two-level programming problem that consists of a lower-level continuous quadratic programming problem with 01 variables fixed and an upper-level nonlinear 01 programming problem.
This paper addresses a new and efficient linearization technique to solve mixed 0-1 polynomial problems to achieve a global optimal solution. Given a mixed 0-1 polynomial term z = c t x 1 x 2 . . . x n y, where x 1 , x 2 , . . . , x n are binary (0-1) variables and y is a continuous variable. Also,
A methodjtir the optimal control of linear time-varying systems with a quadratic cost jitnctional is proposed. The state and control variables are expanded in the shified Legendre series, and an algorithm is provided for approximating the system dynamics, boundary conditions and peyformance index. T