Dual form reduction in the atomic optimization method

Unidimensional optimization problems with polynomial objective function and inequality constraints are considered. For problems dual to their linear relaxations a transformation is presented that makes them compatible with the atomic optimization method, both in its basic and in the generalized form with a reduced number of atoms.