Linear Fractional Programming: Theory. Methods. Applications And Software By E.b. Bajalinov.pdf

The objective function in a linear-fractional problem is both quasiconcave and quasiconvex (hence quasilinear) with a monotone property, pseudoconvexity, which is a stronger property than quasiconvexity. A linear-fractional objective function is both pseudoconvex and pseudoconcave, hence pseudolinear. Since an LFP can be transformed to an LP, it can be solved using any LP solution method, such as the simplex algorithm (of George B. Dantzig),[5][6][7][8] the criss-cross algorithm,[9] or interior-point methods.

linear fractional programming: theory. methods. applications and software by e.b. bajalinov.pdf

Download File: https://www.google.com/url?q=https%3A%2F%2Fgohhs.com%2F2ua8HU&sa=D&sntz=1&usg=AOvVaw0zCmzm7y0TNldGP7IWQjql