This paper presents a new method of obtaining hard test problems for global concave minimization problems. The method starts from a three—satisfiability type of problem and it transforms it into a minimization problem over the unit cube with quadratic or cubic concave objective function. An alternative proof of the NP—hardness of such problems is also given.