𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program

✍ Scribed by Fred Glover and Eugene Woolsey

Book ID
123685998
Publisher
INFORMS
Year
1974
Tongue
English
Weight
139 KB
Volume
22
Category
Article
ISSN
0030-364X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new linearization technique for multi-
A new linearization technique for multi-quadratic 0–1 programming problems
✍ Wanpracha Chaovalitwongse; Panos M Pardalos; Oleg A Prokopyev πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 205 KB

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 variabl

Modelling topology optimization problems
Modelling topology optimization problems as linear mixed 0–1 programs
✍ M. Stolpe; K. Svanberg πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 137 KB

## Abstract This paper deals with topology optimization of discretized continuum structures. It is shown that a large class of non‐linear 0–1 topology optimization problems, including stress‐ and displacement‐constrained minimum weight problems, can equivalently be modelled as __linear__ mixed 0–1