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

DOI10.1007/BF02592064MaRDI QIDQ3757690zbMATH OpenDBLPWikidataFDO

Authors Marco A. Duran, Ignacio E. Grossmann

Publication date 1986

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02592064

zbMATH Keywords

computer-aided designConvergencedecompositionmixed-integer nonlinear programmingoptimality propertiesouter-approximationrelaxation

Mathematics Subject Classification ID

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

Recommendations

• Solving mixed integer nonlinear programs by outer approximation
• Review of nonlinear mixed-integer and disjunctive programming techniques
• Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
• Convex mixed integer nonlinear programming problems and an outer approximation algorithm
• An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs

Cites work

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

Cited in

(only showing first 100 items - show all)

• The stochastic trim-loss problem
• Extended ant colony optimization for non-convex mixed integer nonlinear programming
• A feasibility pump for mixed integer nonlinear programs
• Direct methods with maximal lower bound for mixed-integer optimal control problems
• Global optimization of signomial mixed-integer nonlinear programming problems with free variables
• A kriging based method for the solution of mixed-integer nonlinear programs containing black-box functions
• A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
• New algorithms for product positioning
• Different transformations for solving non-convex trim-loss problems by MINLP
• An improved branch and bound algorithm for mixed integer nonlinear programs
• Solving mixed integer nonlinear programs by outer approximation
• Interactions between nonlinear programming and modeling systems
• A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs
• A hybrid approach to resolving a differentiable integer program.
• Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
• A hybrid LP/NLP paradigm for global optimization relaxations
• Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming
• A global MINLP approach to symbolic regression
• A global optimization for sustainable multi-domain global manufacturing
• On solving generalized convex MINLP problems using supporting hyperplane techniques
• Global optimization of disjunctive programs
• An exact algorithm for a resource allocation problem in mobile wireless communications
• Extended formulations in mixed integer conic quadratic programming
• Lift-and-project cuts for convex mixed integer nonlinear programs
• A trajectory-based method for mixed integer nonlinear programming problems
• Capacitated disassembly scheduling under stochastic yield and demand
• Logistic regression: from art to science
• Mixed integer programming with a class of nonlinear convex constraints
• Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
• Decomposition-based inner- and outer-refinement algorithms for global optimization
• A polyhedral branch-and-cut approach to global optimization
• Mixed integer programming for a special logic constrained optimal control problem
• On speed scaling via integer programming
• Polyhedral approximation in mixed-integer convex optimization
• A multiperiod approach to the solution of groundwater management problems using an outer approximation method
• Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
• An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
• A branch-and-reduce approach to global optimization
• A storm of feasibility pumps for nonconvex MINLP
• Decomposition strategy for the stochastic pooling problem
• A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements
• Inexact solution of NLP subproblems in MINLP
• A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
• An outer-approximation approach for information-maximizing sensor selection
• A review of deterministic optimization methods in engineering and management
• Reverse bridge theorem under constraint partition
• Profitability of online order fulfillment in multi-channel retailing
• Outer approximation for integer nonlinear programs via decision diagrams
• A proximal-point outer approximation algorithm
• Stochastic single-allocation hub location
• Alternate solution approaches for competitive hub location problems
• An effective procedure for feature subset selection in logistic regression based on information criteria
• Outer approximation for global optimization of mixed-integer quadratic bilevel problems
• The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers
• A method for convex black-box integer global optimization
• Partially distributed outer approximation
• Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
• Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization
• Sparse classification: a scalable discrete optimization perspective
• On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints
• Alternative regularizations for outer-approximation algorithms for convex MINLP
• Outer approximation for mixed-integer nonlinear robust optimization
• Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
• An outer-approximation guided optimization approach for constrained neural network inverse problems
• Sparse regression at scale: branch-and-bound rooted in first-order optimization
• Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
• Sparse regression over clusters: SparClur
• Submodularity and local search approaches for maximum capture problems under generalized extreme value models
• Nonlinear chance-constrained problems with applications to hydro scheduling
• Constructing lattice-free gradient polyhedra in dimension two
• Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
• Sample average approximation for stochastic nonconvex mixed integer nonlinear programming via outer-approximation
• A disjunctive cut strengthening technique for convex MINLP
• Inversion of convection-diffusion equation with discrete sources
• Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
• The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities
• Pyomo.GDP: an ecosystem for logic based modeling and optimization development
• A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm
• A combined and robust modal-split/traffic assignment model for rail and road freight transport
• The supporting hyperplane optimization toolkit for convex MINLP
• The backbone method for ultra-high dimensional sparse machine learning
• The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
• Sparse high-dimensional regression: exact scalable algorithms and phase transitions
• A multicut outer-approximation approach for competitive facility location under random utilities
• An overview of MINLP algorithms and their implementation in Muriqui optimizer
• A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
• Generating valid linear inequalities for nonlinear programs via sums of squares
• On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm
• Certifiably optimal sparse inverse covariance estimation
• Stacking sequence and shape optimization of laminated composite plates via a level-set method
• Sparse regression: scalable algorithms and empirical performance
• Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
• Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• First order rejection tests for multiple-objective optimization
• Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand
• Linearization of mixed-integer products
• QPLIB: a library of quadratic programming instances
• Derivative-free robust optimization by outer approximations
• Joint optimization of dynamic pricing and lot-sizing decisions with nonlinear demands: theoretical and computational analysis

Describes a project that uses

Uses Software

• MINOS
• LINDO

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757690)