Abstract
We construct a quadratic function x, with n × k variables, k ≥ 2, and exhibit 2n vertices of the unit hypercube over which f takes distinct values and where each vertex is a strong local maximum of f in the continuous sense as well as in a discrete sense.
Original language | English (US) |
---|---|
Pages (from-to) | 47-49 |
Number of pages | 3 |
Journal | Operations Research Letters |
Volume | 5 |
Issue number | 1 |
DOIs | |
State | Published - Jun 1986 |
All Science Journal Classification (ASJC) codes
- Software
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics
Keywords
- quadratic zero-one convex maximization