Showing 1 - 10 of 26
Persistent link: https://www.econbiz.de/10008673926
In a single-objective setting, nonconvex quadratic problems can equivalently be reformulated as convex problems over the cone of completely positive matrices. In small dimensions this cone equals the cone of matrices which are entrywise nonnegative and positive semidefinite, so the convex...
Persistent link: https://www.econbiz.de/10014501675
Persistent link: https://www.econbiz.de/10010845833
This paper introduces a fully general, exact algorithm for nesting irregular shapes. Both the shapes and material resource can be arbitrary nonconvex polygons. Moreover, the shapes can have holes and the material can have defective areas. Finally, the shapes can be arranged using both...
Persistent link: https://www.econbiz.de/10010994017
Persistent link: https://www.econbiz.de/10008925234
Persistent link: https://www.econbiz.de/10008925254
Persistent link: https://www.econbiz.de/10008925270
Persistent link: https://www.econbiz.de/10008591045
Persistent link: https://www.econbiz.de/10008456024
This paper discusses a power-based transformation technique that is especially useful when solving polynomial optimization problems, frequently occurring in science and engineering. The polynomial nonlinear problem is primarily transformed into a suitable reformulated problem containing new sets...
Persistent link: https://www.econbiz.de/10010896400