A method is presented for the generation of test problems for global optimization algorithms. Given a bounded polyhedron in R and a vertex, the method constructs nonconvex quadratic functions (concave or indefinite) whose global minimum is attained at the selected vertex. The construction requires only the use of linear programming and linear systems of equations.
No takes yet. Share an insight, caveat, or question.
Pãnos M. Pardalos (1987) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: