Abstract

In this paper, a dual problem to linear fractional functionals programming i. e. $$\begin{gathered} Maximise Z = \frac{{c'x}}{{d'x}} \hfill subject to Ax = b \hfill x \geqslant 0 \hfill \end{gathered} $$ is formulated. Certain duality theorems regarding the relationship between primal and dual problems are established.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call