A Chance Constrained Approach to Fractional Programming with Random Numerator
- 81 Downloads
This paper presents a chance constrained programming approach to the problem of maximizing the ratio of two linear functions of decision variables which are subject to linear inequality constraints. The coefficient parameters of the numerator of the objective function are assumed to be random variables with a known multivariate normal probability distribution. A deterministic equivalent of the stochastic linear fractional programming formulation has been obtained and a subsidiary convex program is given to solve the deterministic problem.
KeywordsStochastic programming Chance constraint Linear fractional programming Multivariate normal distribution Deterministic equivalent
- 5.Gupta, S.K., Bector, C.R.: Nature of quotients, products and rational powers of convex (concave) like functions. Maths Student 63–67 (1968)Google Scholar
- 7.Dantzig, G.B., Thapa, M.N.: Linear Programming 2: Theory and Extensions. Springer, New York (2003)Google Scholar
- 11.Sinha, S.M.: A duality theorem on nonlinear programming. Man. Sc. 12, 385–390 (1966)Google Scholar