Methods for solving fractional mathematical programming problems

DOI10.1007/BF01099369MaRDI QIDQ3931036zbMATH OpenFDO

Authors M. A. Shepilov

Publication date 1980

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01099369

zbMATH Keywords

penalty methodconvergence proofDinkelbach solution method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Fractional programming (90C32)

Cites work

• scientific article; zbMATH DE number 3282977 (Why is no real title available?)
• On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming

Cited in

(2)

• Consistency of least-square estimates of parameters of linear difference equations with autocorrelation noise
• Method for the determination of the minimax

This page was built for publication: Methods for solving fractional mathematical programming problems

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