A maximization problem with linear inequality constraints and different kinds of nonconcave objective functions is considered. By means of parametric quadratic programming, the solution of the original problem is reduced to the determination of the absolute maximum of a continuous function of one variable on a bounded interval.
['K. Ritter']
A parametric method for solving certain nonconcave maximization problems