An outer-approximation algorithm for a class of mixed-integer nonlinear programs
From MaRDI portal
Publication:3757690
DOI10.1007/BF02592064zbMATH Open0619.90052DBLPjournals/mp/DuranG86WikidataQ92557467 ScholiaQ92557467MaRDI QIDQ3757690FDOQ3757690
Authors: Marco A. Duran, Ignacio E. Grossmann 
Publication date: 1986
Published in: Mathematical Programming (Search for Journal in Brave)
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
decompositionmixed-integer nonlinear programmingrelaxationcomputer-aided designConvergenceoptimality propertiesouter-approximation
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Mixed integer programming (90C11)
Cites Work
- Convex Analysis
- Partitioning procedures for solving mixed-variables programming problems
- Title not available (Why is that?)
- Some polyhedra related to combinatorial problems
- Generalized Benders decomposition
- 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
- Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Canonical Cuts on the Unit Hypercube
- Disjunctive Programming
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Surrogate Constraints
- Solving an Electricity Generating Capacity Expansion Planning Problem by Generalized Benders' Decomposition
- On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms
- A central cutting plane algorithm for the convex programming problem
- A procedure for new product positioning in an attribute space
- Cutting-Plane Methods without Nested Constraint Sets
- Identification of special structure constraints in linear programs
- An outer approximations algorithm for computer-aided design problems
- Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint Sets
- An Approach to the Optimal Positioning of a New Product
- ZIPMAP -- A Zero-One Integer Programming Model for Market Segmentation and Product Positioning
- A duality theorem and an algorithm for (mixed-) integer nonlinear programming
Cited In (only showing first 100 items - show all)
- Optimal design of multi-echelon supply chain networks under normally distributed demand
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Optimal location of green zones in metropolitan areas to control the urban heat island
- Optimal exact design of double acceptance sampling plans by attributes
- QPLIB: a library of quadratic programming instances
- A branch and bound algorithm for bi-level discrete network design problem
- A trust region SQP algorithm for mixed-integer nonlinear programming
- Linearization of mixed-integer products
- Heuristics for convex mixed integer nonlinear programs
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
- Optimization methods for mixed integer weakly concave programming problems
- Generalized Benders' decomposition for topology optimization problems
- An algorithmic framework for convex mixed integer nonlinear programs
- A flexible platform for mixed-integer non-linear programming problems
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- A planar single facility location and border crossing problem
- A feasibility pump for mixed integer nonlinear programs
- Title not available (Why is that?)
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Sparse classification: a scalable discrete optimization perspective
- Supply capacity acquisition and allocation with uncertain customer demands
- Solving mixed integer nonlinear programs by outer approximation
- Extended ant colony optimization for non-convex mixed integer nonlinear programming
- An algorithm for nonlinear optimization problems with binary variables
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- A new local and global optimization method for mixed integer quadratic programming problems
- An assembly-type supply chain system controlled by kanbans under a just-in-time delivery policy
- A global MINLP approach to symbolic regression
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
- A polyhedral branch-and-cut approach to global optimization
- Sparse regression over clusters: SparClur
- Perspective reformulation and applications
- A storm of feasibility pumps for nonconvex MINLP
- Different transformations for solving non-convex trim-loss problems by MINLP
- Direct methods with maximal lower bound for mixed-integer optimal control problems
- The supporting hyperplane optimization toolkit for convex MINLP
- A dynamic convexized method for nonconvex mixed integer nonlinear programming
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
- An LPCC approach to nonconvex quadratic programs
- The stochastic trim-loss problem
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- Solving planning and design problems in the process industry using mixed integer and global optimization
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Optimization of a complex flexible multibody systems with composite materials
- Stochastic single-allocation hub location
- A recipe for finding good solutions to MINLPs
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- Natural gas production network infrastructure development under uncertainty
- Capacitated facility location-allocation problem for wastewater treatment in an industrial cluster
- Perspective cuts for a class of convex 0-1 mixed integer programs
- A 3D optimal control problem related to the urban heat islands
- GLOMIQO: global mixed-integer quadratic optimizer
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- A branch-and-reduce approach to global optimization
- Mixed integer programming with a class of nonlinear convex constraints
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- A hybrid LP/NLP paradigm for global optimization relaxations
- A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- A kriging based method for the solution of mixed-integer nonlinear programs containing black-box functions
- A review of deterministic optimization methods in engineering and management
- Minotaur: a mixed-integer nonlinear optimization toolkit
- A solution procedure for mixed-integer nonlinear programming formulation of supply chain planning with quantity discounts under demand uncertainty
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- Decomposition strategy for the stochastic pooling problem
- The oracle penalty method
- Computational strategies for non-convex multistage MINLP models with decision-dependent uncertainty and~gradual uncertainty resolution
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Finding multiple solutions to general integer linear programs
- Route optimization for multiple searchers
- Extended formulations in mixed integer conic quadratic programming
- An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- Decomposition-based inner- and outer-refinement algorithms for global optimization
- Mixed integer nonlinear programming tools: an updated practical overview
- Inexact solution of NLP subproblems in MINLP
- Mixed integer nonlinear programming tools: a practical overview
- Mathematical programming approaches for generating \(p\)-efficient points
- Interactions between nonlinear programming and modeling systems
- Sparse high-dimensional regression: exact scalable algorithms and phase transitions
- Sparse regression: scalable algorithms and empirical performance
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
- Two linear approximation algorithms for convex mixed integer nonlinear programming
- On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition
- Global optimization of disjunctive programs
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- Lift-and-project cuts for convex mixed integer nonlinear programs
- A unified approach to mixed-integer optimization problems with logical constraints
- Capacitated disassembly scheduling under stochastic yield and demand
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- Inversion of convection-diffusion equation with discrete sources
- Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- Outer approximation for integer nonlinear programs via decision diagrams
- Challenges in optimal control problems for gas and fluid flow in networks of pipes and canals: from modeling to industrial applications
Uses Software
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)
