On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming

This paper presents results which apply to convex programming problem in parametric form. The results secured are also related to the problem of fractional programming in a way which indicates computational possibilities for the latter class of problems. The results are extended to general non-linear programming problems with special reference to continuous criterion functions. As a particular case, the linear fractional programming problem is considered and, in conclusion, the results secured here are pointed up by reference to existing algorithms for the latter class of problems.

• 저널Management Science · 12(7) · 609–615
• 토픽Optimization and Mathematical Programming · Control and Systems Engineering
• DOI10.1287/mnsc.12.7.609
• 저자R. Jagannathan