×

zbMATH — the first resource for mathematics

Solving pseudo-convex mixed integer optimization problems by cutting plane techniques. (English) Zbl 1035.90051
Summary: In the present paper a cutting plane approach to solve mixed-integer nonlinear programming (MINLP) problems, containing pseudo-convex functions, is given. It is shown how valid cutting planes for pseudo convex functions can be obtained and, furthermore, it is shown how a class of non-convex MINLP problems with a pseudo-convex objective function and pseudo-convex constraints, can be solved to global optimality with the considered cutting plane technique. Finally the numerical efficiency of the procedure, when solving some example problems, is illustrated.

MSC:
90C11 Mixed integer programming
90C30 Nonlinear programming
90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut
Software:
AlphaECP
PDF BibTeX XML Cite
Full Text: DOI