Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
type: Item
instance of: scholarly article
title: Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
zbMATH Open document ID: 1035.90051
DOI: 10.1023/A:1021091110342
author: Tapio Westerlund
author: Ray Pörn
published in: Optimization and Engineering
publication date: 2003-03-12T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1880497
zbMATH Keywords: optimization
zbMATH Keywords: mixed-integer nonlinear programming
zbMATH Keywords: integer nonlinear programming
zbMATH Keywords: quasiconvex functions
zbMATH Keywords: pseudo-convex functions
zbMATH Keywords: non-convex MINLP problems
zbMATH Keywords: extended cutting plane method
describes a project that uses: AlphaECP
MaRDI profile type: Publication
Recommended article: Q3096727
Recommended article: Cutting plane algorithms for the inverse mixed integer linear programming problem
Recommended article: Cutting planes in integer and mixed integer programming
Recommended article: The mixed cutting plane algorithm for all-integer programming
Recommended article: Cuts for Conic Mixed-Integer Programming
Recommended article: An optimality cut for mixed integer linear programs
Recommended article: An interior point cutting plane heuristic for mixed integer programming
Recommended article: Complexity of branch-and-bound and cutting planes in mixed-integer optimization
Recommended article: A disjunctive cutting plane procedure for general mixed-integer linear programs
description: scientific article; zbMATH DE number 1880497