The Security Assignment Problem and Its Solution

Main Article Content

Paul Ryan A. Longhas, Alsafat M. Abdul, Edcon B. Baccay


In this paper we derived a new method for finding the optimal solution to security assignment problems using projection onto a convex set. This study will help communities find the optimal number of assigned and reserved personnels in designating security officers to an area. This study is applicable as well to CCTV assignment problems. The main goal of this study is to give a new method that can be applied in solving security assignment problems. We used some of the known properties of the convex optimization in proving the properties of the optimal solution, such as the concept of proximity operator, projection onto the convex set, and primal and dual problem. In addition to that, we used some basic knowledge in graph theory to answer our real-life application of this study. The main results of this paper showed that we found instances when the optimal solution to a security problem exists and when the solutions exist, we can determine the answer to the problem explicitly. Also, we proved that there always exists a Pseudo-solution in security assignment problems, and if the solution exists, then the Pseudo-solution will coincide with it. The most important aspect of this paper is the introduction of the application of convex optimization in the security problem.

Article Details


  1. Z. Ghazali, M.A.A. Majid, M. Shazwani, Optimal Solution of Transportation Problem Using Linear Programming: A Case of a Malaysian Trading Company, J. Appl. Sci. 12 (2012), 2430-2435.
  2. A.J. Mehta, A.K. Rifai, Goal Programming Application to Assignment Problem in Marketing, J. Acad. Market. Sci. 7 (1979), 108-116.
  3. J.A. Breslaw, A Linear Programming Solution to the Faculty Assignment Problem, Socio-Econ. Plan. Sci. 10 (1976), 227-230.
  4. C. van Dooren, A Review of the Use of Linear Programming to Optimize Diets, Nutritiously, Economically and Environmentally, Front. Nutr. 5 (2018), 48.
  5. J. Foytik, Very Low-Cost Nutritious Diet Plans Designed by Linear Programming, J. Nutr. Educ. 13 (1981), 63-66.
  6. A. Briend, N. Darmon, Determining Limiting Nutrients by Linear Programming: A New Approach to Predict Insufficient Intakes From Complementary Foods, Pediatrics. 106 (2000), 1288-1289.
  7. A. Briend, E. Ferguson, N. Darmon, Local Food Price Analysis by Linear Programming: A New Approach to Assess the Economic Value of Fortified Food Supplements, Food Nutr. Bull. 22 (2001), 184-189.
  8. D.H. Stimson, R.P. Thompson, Linear Programming, Busing and Educational Administration, Socio-Econ. Plan. Sci. 8 (1974), 195-206.
  9. J. Reeb, S. Leavengood, Using Duality and Sensitivity Analysis to Interpret Linear Programming Solutions, Oregon State University, 2000.
  10. H.H. Bauschke, P.L. Combettes, Convex Analysis and Monotone Operator Theory in Hilbert Spaces, Springer, Cham, 2017.
  11. Y.L. Yu, The Proximity Operators, (2014).
  12. J. Dattorro, Convex Optimization in Euclidean Distance Geometry, (2005).
  13. S.P. Boyd, L. Vandenberghe, Convex Optimization, Cambridge University Press, Cambridge, 2004.
  14. J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Elsevier, New York, (1976).
  15. B. Nag, Business Applications of Operations Research, Business Expert Press, New York, 2014.