A ninth bibliography of fractional programming
From MaRDI portal
Publication:5238191
DOI10.1080/02331934.2019.1632250zbMath1431.90156OpenAlexW4233386419WikidataQ127448496 ScholiaQ127448496MaRDI QIDQ5238191
Publication date: 28 October 2019
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2019.1632250
Fractional programming (90C32) History of operations research and mathematical programming (90-03) Bibliographic studies (01A90) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00)
Related Items (15)
An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program ⋮ Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions ⋮ Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data ⋮ An entropic regularized method of centers for continuous minimax problem with semi infinite constraints ⋮ Sequential approximate weak optimality conditions for multiobjective fractional programming problems via sequential calculus rules for the Brøndsted-Rockafellar approximate subdifferential ⋮ A geometric branch-and-bound algorithm for the service bundle design problem ⋮ A potential practical algorithm for minimizing the sum of affine fractional functions ⋮ Optimality and duality for \(E\)-minimax fractional programming: application to multiobjective optimization ⋮ Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution ⋮ Unnamed Item ⋮ Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions ⋮ Geoffrion's proper efficiency in linear fractional vector optimization with unbounded constraint sets ⋮ Saddle-point type optimality criteria, duality and a new approach for solving nonsmooth fractional continuous-time programming problems ⋮ A dual scheme for solving linear countable semi-infinite fractional programming problems ⋮ An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
This page was built for publication: A ninth bibliography of fractional programming
