A linear-fractional programming problem in singular cases (Q1108938): Difference between revisions

The author considers the following linear-fractional programming problem c'x/c''x, \(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 c''x 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.