A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
From MaRDI portal
Publication:1304752
DOI10.1023/A:1008312714792zbMath0949.90097OpenAlexW1538999574MaRDI QIDQ1304752
Ignacio E. Grossmann, Juan M. Zamora
Publication date: 22 September 1999
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008312714792
bilinear termscontinuous global optimizationbounds contractionbranch and contractconcave separable functionslinear fractional terms
Related Items
Linear transformation based solution methods for non-convex mixed integer quadratic programs, Extended reverse-convex programming: an approximate enumeration approach to global optimization, Theoretical and computational results about optimality-based domain reductions, Global optimization with spline constraints: a new branch-and-bound method based on B-splines, A review of recent advances in global optimization, Non polyhedral convex envelopes for 1-convex functions, Alternative branching rules for some nonconvex problems, Tight convex relaxations for the expansion planning problem, Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex, An efficient algorithm and complexity result for solving the sum of general affine ratios problem, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks, General convex relaxations of implicit functions and inverse functions, Domain reduction techniques for global NLP and MINLP optimization, Global optimization problems and domain reduction strategies, An exploratory computational analysis of dual degeneracy in mixed-integer programming, On convex envelopes for bivariate functions over polytopes, A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques, Time-optimal velocity planning by a bound-tightening technique, Three enhancements for optimization-based bound tightening, A technique to derive the analytical form of convex envelopes for some bivariate functions, Multivariate McCormick relaxations, Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes, Convex envelopes of bivariate functions through the solution of KKT systems, A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs, Improve-and-branch algorithm for the global optimization of nonconvex NLP problems, Safe and tight linear estimators for global optimization, A new two-level linear relaxed bound method for geometric programming problems, Convergent upper bounds in global minimization with nonlinear equality constraints, A polyhedral branch-and-cut approach to global optimization, Design of planar articulated mechanisms using branch and bound, On the Performance of NLP Solvers Within Global MINLP Solvers, Solving linear programs with complementarity constraints using branch-and-cut, Mathematical programming formulations for the alternating current optimal power flow problem, Mathematical programming formulations for the alternating current optimal power flow problem, Preface, A geometric branch and bound method for robust maximization of convex functions, Identification of mechanical properties of arteries with certification of global optimality, Convex envelopes for ray-concave functions, A sixth bibliography of fractional programming, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
Uses Software
