Abstract
Abstract The method of Charnes and Cooper converts a linear fractional programming problem into a linear programming problem. This method assumes that the denominator of the objective function is positive on the feasible region and that the latter is bounded. In this paper we show that even when these assumptions are discarded the method, if appropriately interpretated, still works. This extends previous results of Mond and of Gavurin. An application to the computation of probability bounds is given.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
