A global optimization algorithm for linear fractional and bilinear programs
From MaRDI portal
Publication:1890945
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
Cites work
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 193574 (Why is no real title available?)
- A collection of test problems for constrained global optimization algorithms
- A global optimization algorithm for linear fractional and bilinear programs
- A new reformulation-linearization technique for bilinear programming problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- Jointly Constrained Biconvex Programming
- On Nonlinear Fractional Programming
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Programming with linear fractional functionals
- Stochastic techniques for global optimization: A survey of recent advances
Cited in
(37)- Global optimization of bilinear programs with a multiparametric disaggregation technique
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- A global optimization algorithm for linear fractional and bilinear programs
- A combinatorial approach for small and strong formulations of disjunctive constraints
- Multivariate McCormick relaxations
- An RLT approach for solving the binary-constrained mixed linear complementarity problem
- Using two-dimensional projections for stronger separation and propagation of bilinear terms
- On generalized surrogate duality in mixed-integer nonlinear programming
- On generalized surrogate duality in mixed-integer nonlinear programming
- scientific article; zbMATH DE number 6179040 (Why is no real title available?)
- A potential practical algorithm for minimizing the sum of affine fractional functions
- A fifth bibliography of fractional programming*
- scientific article; zbMATH DE number 1423917 (Why is no real title available?)
- BranchHull: convex bilinear inversion from the entrywise product of signals with known signs
- Global solution of optimization problems with signomial parts
- Improve-and-branch algorithm for the global optimization of nonconvex NLP problems
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- Fractional 0-1 programming: applications and algorithms
- Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables
- Safe and tight linear estimators for global optimization
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
- Using conical partition to globally maximizing the nonlinear sum of ratios
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
- Fair transfer price and inventory holding policies in two-enterprise supply chains
- Global optimization of nonlinear sums of ratios
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Three enhancements for optimization-based bound tightening
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
- On the Performance of NLP Solvers Within Global MINLP Solvers
- On the global optimization of sums of linear fractional functions over a convex set
- Maximizing for the sum of ratios of two convex functions over a convex set
- Global optimization algorithm for the nonlinear sum of ratios problem
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- A trajectory-based method for mixed integer nonlinear programming problems
- Generating sum-of-ratios test problems in global optimization
- A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation
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)
