The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Bounded Global Optimization for Polynomial Programming using Binary Reformulation and Linearization
[article]
2012
arXiv
pre-print
This paper describes an approximate method for global optimization of polynomial programming problems with bounded variables. The method uses a reformulation and linearization technique to transform the original polynomial optimization problem into a pair of mixed binary-linear programs. The solutions to these two integer-linear reformulations provide upper and lower bounds on the global solution to the original polynomial program. The tightness of these bounds, the error in approximating each
arXiv:1205.6459v1
fatcat:m3aetsbhzfhxzpouh27yfwvmpi