This paper deals with a concave-convex fractional program. The authors reduce it to a quasiconvex maximization problem and then apply global optimality conditions. The feasible set is an \(n\)-dimensional convex set and the functions involved are differentiable as well as positive functions. An algorithm is proposed for solving the problem approximately. Numerical examples with quadratic functions and box constraints are presented.