An outer-approximation algorithm for a class of mixed-integer nonlinear programs

DOI10.1007/BF02592064zbMath0619.90052DBLPjournals/mp/DuranG86WikidataQ92557467 ScholiaQ92557467MaRDI QIDQ3757690

Ignacio E. Grossmann, Marco A. Duran

Publication date: 1986

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

decompositionrelaxationConvergencecomputer-aided designmixed-integer nonlinear programmingoptimality propertiesouter-approximation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Nonlinear programming (90C30)

Related Items (only showing first 100 items - show all)

COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS ⋮ Genomic feature selection by coverage design optimization ⋮ Optimal design of multivariate acceptance sampling plans by variables ⋮ Constructing Lattice-Free Gradient Polyhedra in Dimension Two ⋮ Using projected cutting planes in the extended cutting plane method ⋮ Stochastic Cutting Planes for Data-Driven Optimization ⋮ Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints ⋮ Mixed-Integer Convex Representability ⋮ A two‐step method for mixed‐integer nonlinear programming problems ⋮ A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization ⋮ An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives ⋮ A Scalable Algorithm for Sparse Portfolio Selection ⋮ Disjunctive cuts in mixed-integer conic optimization ⋮ Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps ⋮ Modeling design and control problems involving neural network surrogates ⋮ Joint location and cost planning in maximum capture facility location under random utilities ⋮ A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities ⋮ Fill‐rate service level constrained distribution network design ⋮ Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods ⋮ Sparse convex optimization toolkit: a mixed-integer framework ⋮ An exact cutting plane method for the Euclidean max-sum diversity problem ⋮ Nonconvex sensitivity-based generalized Benders decomposition ⋮ Optimal exact design of double acceptance sampling plans by attributes ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ A solution algorithm for chance-constrained problems with integer second-stage recourse decisions ⋮ Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs ⋮ Mixed-integer programming techniques for the minimum sum-of-squares clustering problem ⋮ The follower competitive facility location problem under the nested logit choice rule ⋮ Distributed primal outer approximation algorithm for sparse convex programming with separable structures ⋮ An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem ⋮ An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand ⋮ A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques ⋮ Global solution of non-convex quadratically constrained quadratic programs ⋮ Unnamed Item ⋮ A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints ⋮ Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts ⋮ Unnamed Item ⋮ A flexible platform for mixed‐integer non‐linear programming problems ⋮ Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization ⋮ Two-stage stochastic optimization for optimal power flow under renewable generation uncertainty ⋮ Outer-approximation algorithms for nonsmooth convex MINLP problems ⋮ Concurrent processing of mixed‐integer non‐linear programming problems ⋮ Parabolic optimal control problems with combinatorial switching constraints. II: Outer approximation algorithm ⋮ Outer approximation for pseudo-convex mixed-integer nonlinear program problems ⋮ Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones ⋮ Challenges in Optimal Control Problems for Gas and Fluid Flow in Networks of Pipes and Canals: From Modeling to Industrial Applications ⋮ The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming ⋮ Preface ⋮ Improving the performance of DICOPT in convex MINLP problems using a feasibility pump ⋮ Extended cutting plane method for a class of nonsmooth nonconvex MINLP problems ⋮ On the generalization of ECP and OA methods to nonsmooth convex MINLP problems ⋮ High-Performance Prototyping of Decomposition Methods in GAMS ⋮ Conflict Analysis for MINLP ⋮ A solution procedure for mixed-integer nonlinear programming formulation of supply chain planning with quantity discounts under demand uncertainty ⋮ Optimal models for a multi-stage supply chain system controlled by kanban under just-in-time philosophy ⋮ A branch and bound algorithm for bi-level discrete network design problem ⋮ Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches ⋮ Minotaur: a mixed-integer nonlinear optimization toolkit ⋮ A multiperiod approach to the solution of groundwater management problems using an outer approximation method ⋮ Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems ⋮ A hybrid LP/NLP paradigm for global optimization relaxations ⋮ Solving mixed integer nonlinear programs by outer approximation ⋮ A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes ⋮ Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming ⋮ Solving disjunctive optimization problems by generalized semi-infinite optimization techniques ⋮ Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ A 3D optimal control problem related to the urban heat islands ⋮ A global MINLP approach to symbolic regression ⋮ A global optimization for sustainable multi-domain global manufacturing ⋮ A planar single facility location and border crossing problem ⋮ An algebraic geometry algorithm for scheduling in presence of setups and correlated demands ⋮ A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty ⋮ Interactions between nonlinear programming and modeling systems ⋮ A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems ⋮ A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs ⋮ Retrofit of multiproduct batch plants through generalized disjunctive programming ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ On solving generalized convex MINLP problems using supporting hyperplane techniques ⋮ A new local and global optimization method for mixed integer quadratic programming problems ⋮ A branch-and-reduce approach to global optimization ⋮ A recipe for finding good solutions to MINLPs ⋮ A storm of feasibility pumps for nonconvex MINLP ⋮ Global optimization of disjunctive programs ⋮ Decomposition strategy for the stochastic pooling problem ⋮ A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements ⋮ An exact algorithm for a resource allocation problem in mobile wireless communications ⋮ Extended formulations in mixed integer conic quadratic programming ⋮ A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion ⋮ Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability ⋮ Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach ⋮ A four-type decision-variable MINLP model for a supply chain network design ⋮ Inexact solution of NLP subproblems in MINLP ⋮ Lift-and-project cuts for convex mixed integer nonlinear programs ⋮ A hybrid approach to resolving a differentiable integer program. ⋮ A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization ⋮ Heuristics for convex mixed integer nonlinear programs ⋮ An outer-approximation approach for information-maximizing sensor selection ⋮ An LPCC approach to nonconvex quadratic programs ⋮ A trajectory-based method for mixed integer nonlinear programming problems

Uses Software

• LINDO
• MINOS

Cites Work

• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• A procedure for new product positioning in an attribute space
• An outer approximations algorithm for computer-aided design problems
• Some polyhedra related to combinatorial problems
• A duality theorem and an algorithm for (mixed-) integer nonlinear programming
• Generalized Benders decomposition
• An Approach to the Optimal Positioning of a New Product
• The Cutting-Plane Method for Solving Convex Programs
• Optimal short-term scheduling of large-scale power systems
• Solving Large-Scale Zero-One Linear Programming Problems
• Identification of special structure constraints in linear programs
• Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
• Solving an Electricity Generating Capacity Expansion Planning Problem by Generalized Benders' Decomposition
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• A central cutting plane algorithm for the convex programming problem
• ZIPMAP -- A Zero-One Integer Programming Model for Market Segmentation and Product Positioning
• Disjunctive Programming
• On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms
• Surrogate Constraints
• Convex Analysis
• Cutting-Plane Methods without Nested Constraint Sets
• Elements of Large-Scale Mathematical Programming Part I: Concepts
• Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint Sets
• Canonical Cuts on the Unit Hypercube

This page was built for publication: An outer-approximation algorithm for a class of mixed-integer nonlinear programs