Researchers have extended the criss-cross algorithm for many optimization-problems, including linear-fractional programming.
2.
If the objective function is a ratio of a concave and a convex function ( in the maximization case ) and the constraints are convex, then the problem can be transformed to a convex optimization problem using fractional programming techniques.
मोबाइल