A new branch and bound algorithm for minimax ratios problems
From MaRDI portal
Publication:2364779
DOI10.1515/MATH-2017-0072zbMATH Open1368.90134OpenAlexW2732378079MaRDI QIDQ2364779FDOQ2364779
Authors: Yingfeng Zhao, Sanyang Liu, Hong-Wei Jiao 
Publication date: 25 July 2017
Published in: Open Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/math-2017-0072
Recommendations
- An effective branch and bound algorithm for minimax linear fractional programming
- scientific article
- Image space branch-and-bound algorithm for globally solving minimax linear fractional programming problem
- scientific article; zbMATH DE number 6178192
- A branch and bound algorithm to globally solve the sum of several linear ratios
Cites Work
- Delay-interval-dependent robust-stability criteria for neutral stochastic neural networks with polytopic and linear fractional uncertainties
- Hierarchical multi-innovation stochastic gradient algorithm for Hammerstein nonlinear system modeling
- A unified monotonic approach to generalized linear fractional programming
- Strong duality for robust minimax fractional programming problems
- A practicable branch and bound algorithm for sum of linear ratios problem
- Consistency of the extended gradient identification algorithm for multi-input multi-output systems with moving average noises
- An algorithm for generalized fractional programs
- Duality in nondifferentiable minimax fractional programming with generalized convexity
- A new linearization technique for minimax linear fractional programming
- Optimality conditions for nondifferentiable minimax fractional programming with complex variables
- Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios
- Best Rational Approximation and Strict Quasi-Convexity
- Financial planning with fractional goals
- Convergence of a Dinkelbach-type algorithm in generalized fractional programming
- An interior-point method for fractional programs with convex constraints
- On fractional programming problems with absolute-value functions
- A new semismooth Newton method for NCPs based on the penalized KK function
Cited In (7)
- A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming
- Interval division and linearization algorithm for minimax linear fractional program
- Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems
- Title not available (Why is that?)
- A hybrid method for solving non-convex min-max quadratic fractional problems under quadratic constraints
- A new global optimization algorithm for mixed-integer quadratically constrained quadratic fractional programming problem
- An effective branch and bound algorithm for minimax linear fractional programming
This page was built for publication: A new branch and bound algorithm for minimax ratios problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364779)
