Skip to main content
Log in

A Chance Constrained Approach to Fractional Programming with Random Numerator

  • Published:
Journal of Mathematical Modelling and Algorithms

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bajalinov, E.B.: Linear Fractional Programming: Theory, Methods, Applications and Software. Kluwer, Dublin (2003)

    MATH  Google Scholar 

  2. Callahan, J.R., Bector, C.R.: Optimization with global stochastic functions. ZAMM. 55, 528–530 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chandra, S., Gulati, T.R.: A duality theorem for a nondifferentiable fractional programming problem. Man. Sc. 23, 32–37, (1976)

    MATH  MathSciNet  Google Scholar 

  4. Charnes, A., Cooper, W.W.: Deterministic equivalents for optimizing and satisfying under chance constraints. Oper. Res. 11, 18–39 (1963)

    Article  MATH  MathSciNet  Google Scholar 

  5. Gupta, S.K., Bector, C.R.: Nature of quotients, products and rational powers of convex (concave) like functions. Maths Student 63–67 (1968)

  6. Gupta, S.N., Jain, R.K.: Stochastic fractional programming under chance constraints with random technology matrix. Acta Cienc. Indica. XIIm(3), 191–198 (1986)

    MathSciNet  Google Scholar 

  7. Dantzig, G.B., Thapa, M.N.: Linear Programming 2: Theory and Extensions. Springer, New York (2003)

    Google Scholar 

  8. Infanger, G.: Planning under Uncertainty. Boyd and Fraser, Danvers (1994)

    MATH  Google Scholar 

  9. Martos, B.: The direct power of adjacet vertex programming methods. Man. Sc. 12, 241–252 (1965)

    MathSciNet  Google Scholar 

  10. Sharma, I.C., Aggarwal, S.P.: Fractional programming in communication systems. Unternehmensforchung 14(2), 52–155 (1970)

    MathSciNet  Google Scholar 

  11. Sinha, S.M.: A duality theorem on nonlinear programming. Man. Sc. 12, 385–390 (1966)

    Google Scholar 

  12. Swarup, K.: Linear fractional functionals programming. Oper. Res. 13, 1029–1036 (1965)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. N. Gupta.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gupta, S.N. A Chance Constrained Approach to Fractional Programming with Random Numerator. J Math Model Algor 8, 357–361 (2009). https://doi.org/10.1007/s10852-009-9110-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10852-009-9110-8

Keywords

Navigation