Positioning of securities guards on our campuses has been addressed in the literature, using experience-based judgment. In this paper, a mathematical approach is proposed using integer programming model, which addresses the optimal allocation of security guards on Campus Street. An integer programming model was developed. The study illustrates the model workability using federal polytechnic Ilaro campus with twenty-seven constraints and nineteen decision variables. The model was solved via Branch and Bound Technique. The solution indicates that the security guards should be placed on ten strategic junctions at a minimum cost against usual practice of sixteen locations. The model will act as a security support system for any tertiary institution or community that desires to minimize the cost of maintaining security guards.
User
Font Size
Information