An approach to fractional programming via d.c. constraints problem: local search

DOI10.1007/978-3-319-44914-2_32zbMATH Open1392.90112OpenAlexW2557426348MaRDI QIDQ3133231FDOQ3133231

A. S. Strekalovskiĭ, 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

Recommendations

• On solving the sum-of-ratios problem
• A combined algorithm for fractional programming
• On local search in d.c. optimization problems
• On solving the quadratic sum-of-ratios problems
• Duality and Farkas-type results for DC fractional programming with DC constraints

zbMATH Keywords

nonconvex optimizationlocal searchrational optimizationlinearized problemsd.c. representation

Mathematics Subject Classification ID

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

Cited In (5)

• Efficient local search procedures for quadratic fractional programming problems
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133231)