An outer-approximation algorithm for a class of mixed-integer nonlinear programs
type: Item
instance of: scholarly article
title: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
zbMATH Open document ID: 0619.90052
DOI: 10.1007/BF02592064
author: Marco A. Duran
author: Ignacio E. Grossmann
published in: Mathematical Programming
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4005980
zbMATH Keywords: computer-aided design
zbMATH Keywords: outer-approximation
zbMATH Keywords: mixed-integer nonlinear programming
zbMATH Keywords: decomposition
zbMATH Keywords: relaxation
zbMATH Keywords: Convergence
zbMATH Keywords: optimality properties
describes a project that uses: MINOS
describes a project that uses: LINDO
MaRDI profile type: Publication
Wikidata QID: Q92557467
cites work: A procedure for new product positioning in an attribute space
cites work: A duality theorem and an algorithm for (mixed-) integer nonlinear programming
cites work: Disjunctive Programming
cites work: Canonical Cuts on the Unit Hypercube
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Optimal short-term scheduling of large-scale power systems
cites work: Solving an Electricity Generating Capacity Expansion Planning Problem by Generalized Benders' Decomposition
cites work: Analysis of mathematical programming problems prior to applying the simplex algorithm
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: A central cutting plane algorithm for the convex programming problem
cites work: An Approach to the Optimal Positioning of a New Product
cites work: Elements of Large-Scale Mathematical Programming Part I: Concepts
cites work: Generalized Benders decomposition
cites work: Surrogate Constraints
cites work: Some polyhedra related to combinatorial problems
cites work: On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms
cites work: Identification of special structure constraints in linear programs
cites work: Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: An outer approximations algorithm for computer-aided design problems
cites work: Convex Analysis
cites work: Q5603731
cites work: Cutting-Plane Methods without Nested Constraint Sets
cites work: Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint Sets
cites work: ZIPMAP -- A Zero-One Integer Programming Model for Market Segmentation and Product Positioning
DBLP publication ID: journals/mp/DuranG86
description: scientific article