A linear-fractional programming problem in singular cases

DOI10.1007/BF01097991MaRDI QIDQ1108938zbMATH OpenFDO

Authors N. T. Khalitov

Publication date 1973

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

linear-fractional programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Nonlinear programming (90C30) Fractional programming (90C32)

Review text

The author considers the following linear-fractional programming problem c'x/cx, \(Ax=b\), \(x\geq 0\) where c',c,x\(\in R\) n, \(b\in R\) m and A is an (m\(\times n)\)-matrix. If the denominator cx of the objective function is bounded and of constant sign on the set of solutions of the problem, then there arises the possibility of applying the simplex method to obtain the solution of this problem.

Recommendations

• scientific article; zbMATH DE number 4014477
• A new procedure for solving linear fractional programming problems
• Linear fractional programming and duality
• scientific article; zbMATH DE number 3848996
• An algorithm for solving linear fractional programming problems
• scientific article; zbMATH DE number 4156227
• scientific article; zbMATH DE number 3856850
• Linearization of a 0-1 quadratic fractional programming problem
• On semidefinite linear fractional optimization problems

Cited in

(2)

• scientific article; zbMATH DE number 169243 (Why is no real title available?)
• A Fourth bibliography of fractional programming

This page was built for publication: A linear-fractional programming problem in singular cases

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