Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
From MaRDI portal
Publication:1863894
DOI10.1023/A:1021091110342zbMath1035.90051MaRDI QIDQ1863894
Publication date: 12 March 2003
Published in: Optimization and Engineering (Search for Journal in Brave)
optimizationquasiconvex functionsinteger nonlinear programmingmixed-integer nonlinear programmingpseudo-convex functionsextended cutting plane methodnon-convex MINLP problems
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)
Related Items
Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT ⋮ A hybrid LP/NLP paradigm for global optimization relaxations ⋮ A disjunctive cut strengthening technique for convex MINLP ⋮ Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming ⋮ Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support ⋮ Using projected cutting planes in the extended cutting plane method ⋮ Finding multiple solutions to general integer linear programs ⋮ A global MINLP approach to symbolic regression ⋮ An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem ⋮ Mixed integer nonlinear programming tools: an updated practical overview ⋮ The supporting hyperplane optimization toolkit for convex MINLP ⋮ On solving generalized convex MINLP problems using supporting hyperplane techniques ⋮ Validation of nominations in gas network optimization: models, methods, and solutions ⋮ Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems ⋮ Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint ⋮ Inexact solution of NLP subproblems in MINLP ⋮ A new achievement scalarizing function based on parameterization in multiobjective optimization ⋮ A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization ⋮ A trajectory-based method for mixed integer nonlinear programming problems ⋮ A hierarchy of relaxations for nonlinear convex generalized disjunctive programming ⋮ A trust region SQP algorithm for mixed-integer nonlinear programming ⋮ Relax-tighten-round algorithm for optimal placement and control of valves and chlorine boosters in water networks ⋮ A short-turning policy for the management of demand disruptions in rapid transit systems ⋮ Regularized optimization methods for convex MINLP problems ⋮ Solving a dynamic separation problem using MINLP techniques ⋮ A dynamic convexized method for nonconvex mixed integer nonlinear programming ⋮ Outer-approximation algorithms for nonsmooth convex MINLP problems ⋮ Reformulations for utilizing separability when solving convex MINLP problems ⋮ Solving convex MINLP optimization problems using a sequential cutting plane algorithm ⋮ QPLIB: a library of quadratic programming instances ⋮ The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming ⋮ Using regularization and second order information in outer approximation for convex MINLP ⋮ Extended ant colony optimization for non-convex mixed integer nonlinear programming ⋮ Convex mixed integer nonlinear programming problems and an outer approximation algorithm ⋮ Some transformation techniques with applications in global optimization ⋮ Mixed integer nonlinear programming tools: a practical overview ⋮ Maximizing the storage capacity of gas networks: a global MINLP approach
Uses Software
