Abstract
The assignment problem is an important area in Mathematics that hasvarious applications in the fields of science and engineering. Graphs are commonly used for the conceptual representation of complex structures such as documents, text, and images. The matching of graphs also plays a vital role in solving assignment problems. In this paper, we attempt a model of strategy execution in parliamentary democracy as appointment between the prime mister and his/her cabinet minister is introduced. A brief discussion of some important variations of assignment problems such as Cabinet Reshuffle and Optimal Assignment problem also presented. Assignment algorithm is used in an optimal reshuffling of cabinet. The main motive of the Cabinet Reshuffle Assignment Model to assigned extreme numbers of posts to the ministers which they prefer. Kuhn-Munkres algorithm and optimal assignment problems have been examined with the help of working examples.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
