Optimization of functions with rank-two variation over a box
From MaRDI portal
Publication:706945
DOI10.1016/j.ejor.2003.01.001zbMath1120.90057OpenAlexW2024350364MaRDI QIDQ706945
Publication date: 9 February 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.01.001
Large-scale problems in mathematical programming (90C06) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Fractional programming (90C32)
Cites Work
- Unnamed Item
- Unnamed Item
- A complete algorithm for linear fractional programs
- Quadratic programming with one negative eigenvalue is NP-hard
- A simple method for obtaining weakly efficient points in multiobjective linear fractional programming problems
- A Parametric Method for Solving the Linear Fractional Programming Problem
- On Martos' and Chaehes-Coopeb's approach vis-a-vis
- Equivalence of various linearization algorithms for linear fractional programming
- Programming with linear fractional functionals
This page was built for publication: Optimization of functions with rank-two variation over a box