A global optimization algorithm for linear fractional and bilinear programs
From MaRDI portal
Publication:1890945
DOI10.1007/BF01106605zbMATH Open0835.90074OpenAlexW2051668769MaRDI QIDQ1890945FDOQ1890945
Authors: 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
Recommendations
- A global optimization algorithm for linear fractional programming
- Global optimization of generalized linear fractional programming with nonlinear constraints
- On the global optimization of sums of linear fractional functions over a convex set
- A global optimization algorithm for sum of linear ratios problem
- A deterministic global optimization algorithm
global optimizationconvex underestimatorsbilinear programmingspatial branch-and-boundlinear fractional and bilinear terms
Cites Work
- Programming with linear fractional functionals
- On Nonlinear Fractional Programming
- A collection of test problems for constrained global optimization algorithms
- Stochastic techniques for global optimization: A survey of recent advances
- A new reformulation-linearization technique for bilinear programming problems
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A global optimization algorithm for linear fractional and bilinear programs
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- Title not available (Why is that?)
Cited In (37)
- An RLT approach for solving the binary-constrained mixed linear complementarity problem
- On generalized surrogate duality in mixed-integer nonlinear programming
- Global optimization algorithm for the nonlinear sum of ratios problem
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- Fractional 0-1 programming: applications and algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
- Safe and tight linear estimators for global optimization
- Generating sum-of-ratios test problems in global optimization
- A combinatorial approach for small and strong formulations of disjunctive constraints
- On the global optimization of sums of linear fractional functions over a convex set
- 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
- Global solution of optimization problems with signomial parts
- Fair transfer price and inventory holding policies in two-enterprise supply chains
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Global optimization of nonlinear sums of ratios
- A potential practical algorithm for minimizing the sum of affine fractional functions
- Improve-and-branch algorithm for the global optimization of nonconvex NLP problems
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- Maximizing for the sum of ratios of two convex functions over a convex set
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- BranchHull: convex bilinear inversion from the entrywise product of signals with known signs
- On generalized surrogate duality in mixed-integer nonlinear programming
- Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables
- Using conical partition to globally maximizing the nonlinear sum of ratios
- Using two-dimensional projections for stronger separation and propagation of bilinear terms
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
- A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation
- A global optimization algorithm for linear fractional and bilinear programs
- A trajectory-based method for mixed integer nonlinear programming problems
- A fifth bibliography of fractional programming*
- Multivariate McCormick relaxations
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- Three enhancements for optimization-based bound tightening
This page was built for publication: A global optimization algorithm for linear fractional and bilinear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1890945)
