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

From MaRDI portal

Publication:3757690

Jump to:navigation, search

DOI10.1007/BF02592064zbMath0619.90052WikidataQ92557467 ScholiaQ92557467MaRDI QIDQ3757690

Ignacio E. Grossmann, Marco A. Duran

Publication date: 1986

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

zbMATH Keywords

decomposition relaxation Convergence computer-aided design mixed-integer nonlinear programming optimality properties outer-approximation

Mathematics Subject Classification ID

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

Related Items

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, 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, Natural gas production network infrastructure development under uncertainty, Three ideas for a feasibility pump for nonconvex MINLP, 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, An MINLP retrofit approach for improving the flexibility of heat exchanger networks, Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming, Perspective Reformulation and Applications, Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming, An Algorithmic Framework for MINLP with Separable Non-Convexity, The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities, Pyomo.GDP: an ecosystem for logic based modeling and optimization development, On handling indicator constraints in mixed integer programming, A decomposition approach for global optimum search in QP, NLP and MINLP problems, Finding multiple solutions to general integer linear programs, A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm, Cutting Plane Algorithm for Convex Generalized Disjunctive Programs, A combined and robust modal-split/traffic assignment model for rail and road freight transport, Mixed integer nonlinear programming tools: an updated practical overview, Computational strategies for non-convex multistage MINLP models with decision-dependent uncertainty and~gradual uncertainty resolution, The supporting hyperplane optimization toolkit for convex MINLP, Interactive dynamic optimization server – connecting one modelling language with many solvers, The backbone method for ultra-high dimensional sparse machine learning, Shape and discrete sizing optimization of timber trusses by considering of joint flexibility, Supply capacity acquisition and allocation with uncertain customer demands, The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming, Solving a production-routing problem with price-dependent demand using an outer approximation method, 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, Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness, A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times, Capacitated facility location-allocation problem for wastewater treatment in an industrial cluster, A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function, On the approximation of unbounded convex sets by polyhedra, Two linear approximation algorithms for convex mixed integer nonlinear programming, Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution, Hub location problem considering spoke links with incentive-dependent capacities, Rolling horizon-based heuristics for solving a production-routing problem with price-dependent demand, A partial outer convexification approach to control transmission lines, On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition, 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, An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs, Certifiably optimal sparse inverse covariance estimation, Stacking sequence and shape optimization of laminated composite plates via a level-set method, Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems, The unit commitment model with concave emissions costs: a hybrid Benders' decomposition with nonconvex master problems, Finding multiple optimal solutions of signomial discrete programming problems with free variables, Sparse regression: scalable algorithms and empirical performance, Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization, Constraint partitioning in penalty formulations for solving temporal planning problems, Optimization of a complex flexible multibody systems with composite materials, A trust region SQP algorithm for mixed-integer nonlinear programming, 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, Perspective cuts for a class of convex 0-1 mixed integer programs, Linearization of mixed-integer products, A local relaxation approach for the siting of electrical substations, Solving convex MINLP optimization problems using a sequential cutting plane algorithm, QPLIB: a library of quadratic programming instances, Route optimization for multiple searchers, Derivative-free robust optimization by outer approximations, Joint optimization of dynamic pricing and lot-sizing decisions with nonlinear demands: theoretical and computational analysis, An optimization method for solving mixed discrete-continuous programming 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, Using regularization and second order information in outer approximation for convex MINLP, A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems, Wasserstein distributionally robust shortest path problem, Branch-and-price for a class of nonconvex mixed-integer nonlinear programs, Optimal exact designs of experiments via mixed integer nonlinear programming, Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization, Sparse classification: a scalable discrete optimization perspective, Ten years of feasibility pump, and counting, A decomposition method for MINLPs with Lipschitz continuous nonlinearities, 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, Optimal design of multi-echelon supply chain networks under normally distributed demand, Optimal location of green zones in metropolitan areas to control the urban heat island, 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, Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production, 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, A hierarchy of relaxations for nonlinear convex generalized disjunctive programming, A review of deterministic optimization methods in engineering and management, Reverse bridge theorem under constraint partition, Mixed-integer nonlinear programs featuring ``on/off constraints, Rehabilitation and replacement of water distribution system components considering uncertainties, Generalized Benders' decomposition for topology optimization problems, A working set SQCQP algorithm with simple nonmonotone penalty parameters, An improved Bernstein global optimization algorithm for MINLP problems with application in process industry, A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures, Strong-branching inequalities for convex mixed integer nonlinear programs, Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs, Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming, Truss topology optimization with discrete design variables by outer approximation, Optimization methods for mixed integer weakly concave programming problems, Lago: a (heuristic) branch and cut algorithm for nonconvex minlps, Capacitated disassembly scheduling under stochastic yield and demand, An algorithmic framework for convex mixed integer nonlinear programs, Profitability of online order fulfillment in multi-channel retailing, Logistic regression: from art to science, Mixed integer programming with a class of nonlinear convex constraints, Regularized optimization methods for convex MINLP problems, 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 dynamic convexized method for nonconvex mixed integer nonlinear programming, The oracle penalty method, An assembly-type supply chain system controlled by kanbans under a just-in-time delivery policy, An algorithm for nonlinear optimization problems with binary variables, Outer approximation for integer nonlinear programs via decision diagrams, Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes, A proximal-point outer approximation algorithm, A polyhedral branch-and-cut approach to global optimization, Mixed integer programming for a special logic constrained optimal control problem, Reformulations for utilizing separability when solving convex MINLP problems, Integrality gap minimization heuristics for binary mixed integer nonlinear programming, Combinatorial optimal control of semilinear elliptic PDEs, On speed scaling via integer programming, Stochastic single-allocation hub location, Mathematical programming approaches for generating \(p\)-efficient points, Alternate solution approaches for competitive hub location problems, Polyhedral approximation in mixed-integer convex optimization, The stochastic trim-loss problem, Extended ant colony optimization for non-convex mixed integer nonlinear programming, A feasibility pump for mixed integer nonlinear programs, Convex mixed integer nonlinear programming problems and an outer approximation algorithm, 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, Mixed integer nonlinear programming tools: a practical overview, New algorithms for product positioning, Different transformations for solving non-convex trim-loss problems by MINLP, Sparse hierarchical regression with polynomials, An improved branch and bound algorithm for mixed integer nonlinear programs, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems, Solving planning and design problems in the process industry using mixed integer and global optimization

Uses Software

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3757690&oldid=17290447"