INTRODUCTION
        
         In mathematics and computer science, an 
        optimization problem is the problem of finding the 
        best solution from all feasible solutions.
        
         Types of Optimization problems   =  Optimization 
        problems can be divided into two categories 
        depending on whether the variables are continuous 
        or discrete.
        TYPES OF OPTIMIZATION PROBLEM
        
         An optimization problem with discrete variables is 
        known as a combinatorial optimization problem. 
        
         In a combinatorial optimization problem, we are 
        looking for an object such as an integer, permutation 
        or graph from a finite (or possibly accountably 
        infinite) set. Problems with continuous variables 
        include constrained problems and multimodal 
        problems.
           WAY TO SOLVE OPTIMIZATION 
                    PROBLEM
        
           Assignment 
        problem
        ASSIGNMENT PROBLEM DEFINITION 
        
         The assignment problem is one of the fundamental 
        combinatorial optimization problems in the branch of 
        optimization or operations  research in mathematics. 
        It consists of finding a maximum weight matching (or 
        minimum weight perfect matching) in a weighted 
        bipartite graph. 
                     ASSIGNMENT PROBLEM
                     MATHEMATICAL FORM 
            
                                  ij xij
            Such that:                                               
                                                           ij = 1
                                                           ij = 1
                                                X >= 0; For (i,j = 1,…,m)
                                 ij