An Approach to Fractional Programming via D.C. Constraints Problem: Local Search

DOI10.1007/978-3-319-44914-2_32zbMath1392.90112OpenAlexW2557426348MaRDI QIDQ3133231

Alexander S. Strekalovsky, Tatiana V. Gruzdeva

Publication date: 13 February 2018

Published in: Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44914-2_32

zbMATH Keywords

local searchnonconvex optimizationrational optimizationlinearized problemsd.c. representation

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Fractional programming (90C32)

Related Items (4)

On solving the sum-of-ratios problem ⋮ Acceleration procedure for special classes of multi-extremal problems ⋮ An inertial algorithm for DC programming ⋮ Fractional programming approach to a cost minimization problem in electricity market

This page was built for publication: An Approach to Fractional Programming via D.C. Constraints Problem: Local Search