A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms

DOI10.1023/A:1008312714792zbMATH Open0949.90097OpenAlexW1538999574MaRDI QIDQ1304752FDOQ1304752

Authors: Juan M. Zamora, Ignacio E. Grossmann 

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

Recommendations

• A global optimization algorithm for linear fractional and bilinear programs
• A branch and bound-outer approximation algorithm for concave minimization over a convex set
• On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope
• A finite algorithm for concave minimization over a polyhedron
• scientific article; zbMATH DE number 2146951

zbMATH Keywords

bilinear termscontinuous global optimizationbounds contractionbranch and contractconcave separable functionslinear fractional terms

Mathematics Subject Classification ID

Fractional programming (90C32) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cited In (45)

• Convergent upper bounds in global minimization with nonlinear equality constraints
• Solving linear programs with complementarity constraints using branch-and-cut
• A comparison of alternative models for solving a non-linear single plant hydro unit commitment problem
• Alternative branching rules for some nonconvex problems
• An exploratory computational analysis of dual degeneracy in mixed-integer programming
• Design of planar articulated mechanisms using branch and bound
• A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
• Convex envelopes of bivariate functions through the solution of KKT systems
• A review of recent advances in global optimization
• Extended reverse-convex programming: an approximate enumeration approach to global optimization
• Theoretical and computational results about optimality-based domain reductions
• Safe and tight linear estimators for global optimization
• Global optimization with spline constraints: a new branch-and-bound method based on B-splines
• Linear transformation based solution methods for non-convex mixed integer quadratic programs
• A polyhedral branch-and-cut approach to global optimization
• Preface
• Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms
• Non polyhedral convex envelopes for 1-convex functions
• A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
• On the Performance of NLP Solvers Within Global MINLP Solvers
• A new two-level linear relaxed bound method for geometric programming problems
• Improve-and-branch algorithm for the global optimization of nonconvex NLP problems
• Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
• Tight convex relaxations for the expansion planning problem
• A geometric branch and bound method for robust maximization of convex functions
• Global optimization problems and domain reduction strategies
• General convex relaxations of implicit functions and inverse functions
• Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
• An efficient algorithm and complexity result for solving the sum of general affine ratios problem
• Identification of mechanical properties of arteries with certification of global optimality
• A sixth bibliography of fractional programming
• Mathematical programming formulations for the alternating current optimal power flow problem
• Mathematical programming formulations for the alternating current optimal power flow problem
• Time-optimal velocity planning by a bound-tightening technique
• Domain reduction techniques for global NLP and MINLP optimization
• Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
• On convex envelopes for bivariate functions over polytopes
• A technique to derive the analytical form of convex envelopes for some bivariate functions
• Interval constraint programming for globally solving catalog-based categorical optimization
• Multivariate McCormick relaxations
• Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
• Convex envelopes for ray-concave functions
• Three enhancements for optimization-based bound tightening
• Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes

Uses Software

• GAMS

This page was built for publication: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms

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