A global optimization algorithm for linear fractional and bilinear programs
From MaRDI portal
Publication:1890945
DOI10.1007/BF01106605zbMath0835.90074OpenAlexW2051668769MaRDI QIDQ1890945
Ignacio Quesada, Ignacio E. Grossmann
Publication date: 15 April 1996
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01106605
global optimizationbilinear programmingconvex underestimatorsspatial branch-and-boundlinear fractional and bilinear terms
Related Items
On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming, A fifth bibliography of fractional programming*, A global optimization algorithm for linear fractional and bilinear programs, Unnamed Item, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Maximizing for the sum of ratios of two convex functions over a convex set, A global optimization algorithm for solving the minimum multiple ratio spanning tree problem, Generating sum-of-ratios test problems in global optimization, Fractional 0-1 programming: applications and algorithms, A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem, Global optimization of bilinear programs with a multiparametric disaggregation technique, A potential practical algorithm for minimizing the sum of affine fractional functions, A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems, A trajectory-based method for mixed integer nonlinear programming problems, Using conical partition to globally maximizing the nonlinear sum of ratios, Global solution of optimization problems with signomial parts, 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, Three enhancements for optimization-based bound tightening, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Multivariate McCormick relaxations, An RLT approach for solving the binary-constrained mixed linear complementarity problem, On the global optimization of sums of linear fractional functions over a convex set, Improve-and-branch algorithm for the global optimization of nonconvex NLP problems, Safe and tight linear estimators for global optimization, On the Performance of NLP Solvers Within Global MINLP Solvers, Global optimization of nonlinear sums of ratios, Global optimization algorithm for the nonlinear sum of ratios problem, Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables, BranchHull: convex bilinear inversion from the entrywise product of signals with known signs, Fair transfer price and inventory holding policies in two-enterprise supply chains, On generalized surrogate duality in mixed-integer nonlinear programming, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- A collection of test problems for constrained global optimization algorithms
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- Stochastic techniques for global optimization: A survey of recent advances
- A new reformulation-linearization technique for bilinear programming problems
- A global optimization algorithm for linear fractional and bilinear programs
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Programming with linear fractional functionals
- On Nonlinear Fractional Programming
