Transportation technique for quadratic fractional programming

Authors

  • S. Aggarwal University of Calgary, Canada

Abstract

In this paper a transportation technique for a quadratic fractional programming subject to linear constraints has been provided. In another article it has been shown that this function is pseudo monotonic which gives local optimum as global optimum.

Downloads

Published

1972-10-01

How to Cite

Aggarwal, S. (1972). Transportation technique for quadratic fractional programming. JORBEL - Belgian Journal of Operations Research, Statistics, and Computer Science, 12(2), 3–7. Retrieved from https://www.orbel.be/jorbel/index.php/jorbel/article/view/523

Issue

Vol. 12 No. 2 (1972)

Section

Articles