Fractional programming without differentiability
The notion of quasi-differentiability is examined and related to fractional programming. Necessary and sufficient conditions are given and various other properties of quasi-differentiable functions are discussed. Differentiability is not assumed.
KeywordsMathematical Method Fractional Programming
Unable to display preview. Download preview PDF.
- C.R. Bector, “Duality in nonlinear fractional programming”,Zeitschrift für Operations Research 17 (1973) 183–193.Google Scholar
- F.E. Browder, “Nonlinear maximal monotone operators in banach space”,Mathematische Annalen 175 (1968) 89–113.Google Scholar
- R. Jagannathan, “Duality for nonlinear fractional programs”,Zeitschrift für Operations Research 17, (1973), 1–3.Google Scholar
- C.J. Minty, “On the monotonicity of the gradient of a convex function”,Pacific Journal of Mathematics 14 (1964) 243–247.Google Scholar
- J. Ponstein, “Seven kinds of convexity”,SIAM Review 2 (1967) 115–119.Google Scholar
- B.N. Pshenichnyi,Necessary conditions for an extremum, (Marcel Dekker, New York, 1971).Google Scholar
- R.T. Rockafellar,Convex analysis (Princeton Univ. Press, Princeton, N.J., 1970).Google Scholar
- S. Schaible, “Parameter-free convex equivalent and dual programs of fractional programming problems”,Zeitschrift für Operations Research 18 (1974) 187–196.Google Scholar
- P. Wolfe, “A duality theorem for non-linear programming”,Quarterly of Applied Mathematics 19 (1961) 239–244.Google Scholar