Assignment Problem (Hungarian Method)

Duration: 27 min

This video lesson is available to enrolled students.

Return to /learn/NTA-UGC-NET-PAPER-2/unit-1-discrete-structures-and-optimization/optimization/assignment-problem-formulation-and-hungarian-method/asset-assignment-problem-hungarian-method after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Course Overview: About the Course
  2. Paper - 1 | Unit - 1 | Teaching Aptitude: शिक्षण की अवधारणा एवं उद्देश्य / Concept and Objectives of Teaching, शिक्षण के स्तर / Levels of Teaching, शिक्षार्थी की विशेषताएँ / Learner's Characteristics, अधिगम: प्रकृति एवं सिद्धांत / Learning: Nature and Theories, संज्ञान, स्मृति एवं अधिसंज्ञान / Cognition, Memory and Metacognition, शिक्षण को प्रभावित करने वाले कारक / Factors Affecting Teaching, प्रभावी शिक्षण एवं शिक्षक / Effective Teaching and the Teacher, अनुदेशनात्मक उद्देश्य एवं पाठ नियोजन / Instructional Objectives and Lesson Planning, शिक्षण विधियाँ / Methods of Teaching, ऑफ़लाइन एवं ऑनलाइन शिक्षण विधियाँ / Offline and Online Teaching Methods, शिक्षण सहायक प्रणाली / Teaching Support System, मूल्यांकन प्रणाली / Evaluation Systems, Nature, Objectives & Characteristics of Teaching, Learners & Learning Process, Teaching-Learning Aids & ICT Integration, Sāṃkhya, व्यक्तिगत व्यवहार / Individual Behaviour, मानव संसाधन प्रबंधन / Human Resource Management, बाल्यावस्था में विकास के क्षेत्र / Domains of Child Development, संवेग का जैविक आधार / Biological Basis of Emotion, उपनिषद और भगवद्गीता / Upanishads and Bhagavad Gita, केन्द्रीय और परिधीय तंत्रिका तंत्र / Central and Peripheral Nervous Systems
  3. Paper - 1 | Unit - 2 | Research Aptitude: अनुसंधान: अर्थ, लक्षण व वैज्ञानिक विधि / Research: Meaning, Features and Scientific Method, अनुसंधान के प्रतिमान एवं उपागम / Research Paradigms and Approaches, अनुसंधान के प्रकार / Types of Research, चर एवं मापन / Variables and Measurement, अनुसंधान की विधियाँ / Methods of Research, अनुसंधान के चरण / Steps of Research, प्रतिचयन / Sampling, आँकड़ा संग्रह के उपकरण एवं विधियाँ / Tools and Methods of Data Collection, आँकड़ा विश्लेषण एवं शोध सांख्यिकी / Data Analysis and Statistics in Research, शोध-प्रबंध एवं लेख लेखन / Thesis and Article Writing, अनुसंधान में ICT का अनुप्रयोग / Application of ICT in Research, शोध नैतिकता / Research Ethics, Introduction to Research, Validity & Reliability, Research Paradigms & Types of Research, Research Ethics, Writing & Publication
  4. Paper - 1 | Unit - 3 | Comprehension: प्रत्यक्ष बोध / Literal Comprehension, गद्यांश में शब्दावली और भाषा / Vocabulary and Language in Context, निष्कर्षात्मक बोध / Inferential Comprehension, आलोचनात्मक बोध / Critical Comprehension, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Restoration and Eighteenth-Century Drama, Modern British Fiction, William Shakespeare, Mid-Twentieth-Century and Contemporary British Fiction, American Drama
  5. Paper - 1 | Unit - 4 | Communication: संचार: अर्थ, प्रकृति एवं प्रक्रिया / Communication: Meaning, Nature and Process, संचार के प्रकार एवं स्तर / Types and Levels of Communication, मौखिक एवं अमौखिक संचार / Verbal and Non-verbal Communication, संकेत विज्ञान एवं अर्थ / Semiotics and Meaning, संचार के मॉडल एवं सिद्धांत / Models and Theories of Communication, प्रभावी संचार / Effective Communication, संचार की बाधाएँ / Barriers to Communication, कक्षा संचार / Classroom Communication, जनसंचार माध्यम: प्रकार एवं विकास / Mass Media: Types and Evolution, जनसंचार एवं समाज / Mass Media and Society, डिजिटल एवं नव माध्यम / Digital and New Media, Communication Basics, Language and Semiotics, Mass Communication, Mass Media, Journalism, General Knowledge and General Studies related to Communication, Static General Knowledge, Morphology and Syntax, जन स्वास्थ्य पोषण / Public Health Nutrition, Newtonian Motion and Stability, GK- Current Affairs, Indian Economy, Art and Architecture, India after Independence
  6. Paper - 1 | Unit - 5 | Mathematical Reasoning and Aptitude: संख्या पद्धति एवं सरलीकरण / Number System and Simplification, बीजगणित एवं आयु / Algebra and Ages, प्रतिशतता / Percentage, अनुपात, समानुपात, साझेदारी एवं मिश्रण / Ratio, Proportion, Partnership and Mixtures, औसत / Averages, लाभ, हानि एवं बट्टा / Profit, Loss and Discount, साधारण एवं चक्रवृद्धि ब्याज / Simple and Compound Interest, समय एवं कार्य / Time and Work, चाल, समय एवं दूरी / Speed, Time and Distance, क्षेत्रमिति एवं ज्यामिति / Mensuration and Geometry, श्रेणी / Series, कूटलेखन-कूटवाचन / Coding-Decoding, संबंध, दिशा एवं क्रम / Relationships, Directions and Ranking, व्यवस्था, पहेलियाँ, घड़ी एवं कैलेंडर / Arrangements, Puzzles, Clock and Calendar, Series (Number and Letter Series) (Numerical Relations and Reasoning), Ratio and Proportion (Ratios), Powers and Exponents (Surds and Indices), Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Verbal Analogy (Word Based Analogy), Divisibility Rules, Miscellaneous, Mathematical Foundations, Polity, जीवनी, Deconstruction, Gender and Queer Theory, Modern British and Irish Poetry, Central Force and Scattering, Chemical thermodynamics, Microscopic techniques, संविधान का दर्शन / Philosophy of the Constitution, Waves, Optics and Charged-Particle Motion, Membrane structure and function, Analysis
  7. Paper - 1 | Unit - 6 | Logical Reasoning: युक्ति की संरचना / Structure of Arguments, पद, परिभाषा एवं भाषा के उपयोग / Terms, Definitions and Uses of Language, निरुपाधिक प्रतिज्ञप्तियाँ / Categorical Propositions, निरुपाधिक न्यायवाक्य / Categorical Syllogism, वेन आरेख / Venn Diagrams, निगमन, आगमन एवं सादृश्यता / Deduction, Induction and Analogy, तर्कदोष / Fallacies, भारतीय तर्कशास्त्र: प्रमाण / Indian Logic: Pramanas, अनुमान एवं व्याप्ति / Anumana and Vyapti, हेत्वाभास / Hetvabhasa, Syllogisms, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Venn Diagram, School Of Thoughts, Western Logic, Aristotle, पाश्चात्य दर्शन की विचारधाराएँ / Western Schools of Philosophy, Kant, Sadhana Paada, Vaiśeṣika
  8. Paper - 1 | Unit - 7 | Data Interpretation: आँकड़े एवं आलेखीय निरूपण / Data and Graphical Representation, आँकड़ा निर्वचन: तालिका / Data Interpretation: Tables
  9. Paper - 1 | Unit - 8 | Information and Communication Technology: कंप्यूटर की मूल बातें और हार्डवेयर / Computer Fundamentals and Hardware, मेमोरी, भंडारण और डेटा निरूपण / Memory, Storage and Data Representation, कंप्यूटर सॉफ्टवेयर / Computer Software, ऑफिस अनुप्रयोग / Office Applications, मल्टीमीडिया और फ़ाइल प्रारूप / Multimedia and File Formats, कंप्यूटर नेटवर्क / Computer Networks, इंटरनेट और वर्ल्ड वाइड वेब / Internet and World Wide Web, ई-मेल और ऑनलाइन संचार / Email and Online Communication, साइबर सुरक्षा / Cyber Security, डिजिटल नैतिकता, बौद्धिक संपदा और समाज / Digital Ethics, IPR and Society, क्लाउड और वितरित कंप्यूटिंग / Cloud and Distributed Computing, उभरती प्रौद्योगिकियाँ / Emerging Technologies, शिक्षा और शासन में ICT / ICT in Education and Governance, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Electronic Data Interchange and E-Commerce, Internet Fundamentals, Web Design & Development, Web Publishing & Hosting, Emerging Technologies, Terms & Abbreviations, Artificial Intelligence, Society, Law & Ethics, Keyboard Shortcuts, Website, Browser & Services, भौगोलिक संकेतों का संरक्षण / Protection of Geographical Indications
  10. Paper - 1 | Unit - 9 | People Development and Environment: पारितंत्र और जैव विविधता / Ecosystems and Biodiversity, मानव और पर्यावरण की अंतःक्रिया / Human and Environment Interaction, विकास और पर्यावरण / Development and Environment, प्राकृतिक संसाधन: वन, जल और मृदा / Natural Resources – Forests, Water and Soil, ऊर्जा संसाधन / Energy Resources, वायु प्रदूषण / Air Pollution, जल प्रदूषण और उपचार / Water Pollution and Treatment, ध्वनि प्रदूषण / Noise Pollution, अपशिष्ट प्रबंधन / Waste Management, पर्यावरणीय स्वास्थ्य और विषविज्ञान / Environmental Health and Toxicology, जलवायु परिवर्तन और वैश्विक पर्यावरणीय समस्याएँ / Climate Change and Global Environmental Issues, प्राकृतिक प्रकोप और आपदा प्रबंधन / Natural Hazards and Disaster Management, भारतीय पर्यावरण कानून और नीतियाँ / Indian Environmental Laws and Policies, अंतर्राष्ट्रीय पर्यावरण समझौते / International Environmental Agreements, Ecosystem, Biomes & Environmental Issues, Noise Pollution and Waste Management, Natural Resources, Energy & Disaster Management, Environment, Geography, कारखाना और उद्योग व्यवस्थाएँ / Factory and Industry Systems, Earth Materials, Surface Features and Processes, संक्रामक रोग और प्रतिरक्षण / Communicable Diseases and Immunization
  11. Paper - 1 | Unit - 10 | Higher Education System: प्राचीन भारत में शिक्षा / Education in Ancient India, प्राचीन भारत के उच्च शिक्षा केंद्र / Ancient Centres of Higher Learning, औपनिवेशिक काल की शिक्षा नीतियाँ और आयोग / Colonial Education Policies and Commissions, औपनिवेशिक कॉलेज, विश्वविद्यालय व सुधारक / Colonial Colleges, Universities and Reformers, स्वतंत्र भारत में शिक्षा आयोग और नीतियाँ / Education Commissions and Policies after Independence, राष्ट्रीय शिक्षा नीति 2020 / National Education Policy 2020, उच्च शिक्षा संस्थानों के प्रकार / Types of Higher Education Institutions, अधिगम कार्यक्रम और अकादमिक क्रेडिट / Learning Programmes and Academic Credits, व्यावसायिक, तकनीकी और कौशल आधारित शिक्षा / Professional, Technical and Skill-Based Education, मूल्य शिक्षा और पर्यावरण शिक्षा / Value Education and Environmental Education, शासन, प्रशासन और वित्तपोषण / Governance, Administration and Financing, उच्च शिक्षा का नियमन, प्रत्यायन और रैंकिंग / Regulation, Accreditation and Ranking, Jainism & Buddhism, Pre-Independence Commissions, Post-Independence Policy, Higher Education Structure & Accreditation, Universities & Learning Programmes, Types of Education & NEP 2020
  12. Paper 2 | Unit 1 | Discrete Structures and Optimization: Propositional and Predicate Logic, Set Theory, Relations, Functions, क्रमचय, संचय एवं प्रायिकता / Permutation, Combination and Probability, Probability, Graph Theory, Group Theory, Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Optimization, Markov Chains
  13. Paper 2 | Unit 2 | Computer System Architecture: Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Basics of COA, Register Transfer and Microoperations, Programming the Basic Computer, Instr Formats & Modes, Control Unit Design, Pipelining, Input Output Organisation, Cache Memory Organization, Multiprocessors
  14. Paper 2 | Unit 3 | Programming Languages and Computer Graphics: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, HTML Basics, XML, JavaScript-Basics, Java, Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, OOPS with C++, Java Fundamentals, Array, String, IO & References, OOPS with Java
  15. Paper 2 | Unit 4 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  16. Paper 2 | Unit 5 | System Software and Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  17. Paper 2 | Unit 6 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  18. Paper 2 | Unit 7 | Data Structures and Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  19. Paper 2 | Unit 8 | Theory of Computation and Compilers: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  20. Paper 2 | Unit 9 | Data Communication and Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Mobile Technology, Cloud Computing and IoT, Cloud Computing
  21. Paper 2 | Unit 10 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  22. Live Classes: NTA UGC NET 2025 Live Class
  23. Paper 1 | Full Mock Tests:
  24. Paper 2 | Full Mock Tests:
  25. Paper 1 | Previous Year Papers:
  26. Paper 2 | Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This video is a detailed, step-by-step tutorial on solving a minimization assignment problem using the Hungarian Method. The instructor begins by presenting a 5x5 cost matrix, which represents the cost of assigning five jobs (I, II, III, IV, V) to five workers (A, B, C, D, E). The core of the lesson is the application of the Hungarian Method, which involves a series of systematic reductions. The first step shown is Row Reduction, where the smallest value in each row is subtracted from all elements in that row. The instructor demonstrates this process for each of the five rows, resulting in a new matrix. The next step is Column Reduction, where the smallest value in each column of the row-reduced matrix is subtracted from all elements in that column. The instructor performs this calculation, leading to a matrix with at least one zero in each row and column. The video then transitions to the assignment phase, where the instructor explains the process of covering all zeros with the minimum number of lines. The method involves marking rows and columns with zeros to determine if an optimal assignment is possible. The instructor identifies that the number of lines required (four) is less than the number of rows (five), indicating that the solution is not yet optimal. The final part of the video shows the instructor calculating the smallest uncovered value (which is 2) and using it to adjust the matrix by subtracting it from all uncovered elements and adding it to elements covered by two lines. This process is repeated until an optimal assignment is found, and the final cost is calculated by summing the original costs of the assigned jobs.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with a whiteboard displaying the title 'Linear Programming Problem' and the sub-topic 'Minimize Assignment Problem'. The instructor, a man in a pink shirt, begins by writing a 5x5 cost matrix on the board. The matrix has rows labeled I, II, III, IV, V and columns labeled A, B, C, D, E. The instructor then writes the title 'Assignment Problem (Hungarian Method)' on the board, indicating the method to be used. On the right side of the board, a list of steps for the Hungarian Method is visible, starting with '1. Row Reduction' and '2. Column Reduction'. The instructor is seen writing the first row of the cost matrix, which is 6, 12, 3, 11, 15.

  2. 2:00 – 5:00 02:00-05:00

    The instructor proceeds to perform the first step of the Hungarian Method: Row Reduction. He explains that the smallest value in each row must be subtracted from all elements in that row. He starts with the first row, which has values 6, 12, 3, 11, 15. He identifies the minimum value as 3 and subtracts it from each element, resulting in a new row: 3, 9, 0, 8, 12. He then moves to the second row (4, 2, 7, 1, 10), identifies the minimum as 1, and subtracts it to get 3, 1, 6, 0, 9. He continues this process for the third row (4, 2, 7, 1, 10), subtracting 1 to get 3, 1, 6, 0, 9. For the fourth row (8, 11, 10, 7, 11), the minimum is 7, resulting in 1, 4, 3, 0, 4. For the fifth row (16, 19, 12, 23, 21), the minimum is 12, resulting in 4, 7, 0, 11, 9. The instructor then writes the resulting matrix on the board.

  3. 5:00 – 10:00 05:00-10:00

    After completing the row reduction, the instructor moves to the second step: Column Reduction. He explains that the smallest value in each column of the row-reduced matrix must be subtracted from all elements in that column. He begins with the first column of the row-reduced matrix: 3, 3, 3, 1, 4. The minimum value is 1, so he subtracts 1 from each element, resulting in 2, 2, 2, 0, 3. He continues this for the second column (9, 1, 1, 4, 7), where the minimum is 1, resulting in 8, 0, 0, 3, 6. For the third column (0, 6, 6, 3, 0), the minimum is 0, so the values remain unchanged. For the fourth column (8, 0, 0, 0, 11), the minimum is 0, so the values remain unchanged. For the fifth column (12, 9, 9, 4, 9), the minimum is 4, resulting in 8, 5, 5, 0, 5. The instructor writes the final column-reduced matrix on the board.

  4. 10:00 – 15:00 10:00-15:00

    The instructor now begins the assignment phase. He explains that the goal is to find the minimum number of lines (horizontal and vertical) required to cover all the zeros in the matrix. He starts by marking the rows that have exactly one zero. He identifies row I (2, 8, 0, 8, 8) has a single zero in column C, so he marks row I. Row II (2, 0, 0, 5, 5) has two zeros, so he does not mark it. Row III (2, 0, 0, 0, 5) has three zeros, so he does not mark it. Row IV (0, 3, 3, 0, 0) has two zeros, so he does not mark it. Row V (3, 6, 0, 5, 5) has a single zero in column C, so he marks row V. He then marks the columns that have exactly one zero. Column C has zeros in rows I, II, III, and V, so it is not marked. Column D has a zero in row IV, so he marks column D. He then marks the rows that have a zero in a marked column. Row IV has a zero in column D, so he marks row IV. He then marks the columns that have a zero in a marked row. Column C has a zero in row IV, so he marks column C. He repeats this process until no more rows or columns can be marked. He then draws lines through the unmarked rows and marked columns. He counts the number of lines drawn, which is four, and notes that this is less than the number of rows (five), indicating that the solution is not optimal.

  5. 15:00 – 20:00 15:00-20:00

    The instructor explains the next step when the number of lines is less than the number of rows. He states that the smallest value among the uncovered elements must be found. He identifies the uncovered elements in the matrix: 2, 8, 8, 2, 0, 0, 0, 3, 3, 0, 0, 5, 5, 3, 6, 0, 5, 5. The smallest value among these is 2. He then explains the adjustment process: subtract this value (2) from all uncovered elements and add it to all elements covered by two lines. He demonstrates this by subtracting 2 from the uncovered elements (e.g., 2 becomes 0, 8 becomes 6, 8 becomes 6, etc.) and adding 2 to the elements covered by two lines (e.g., 0 becomes 2, 0 becomes 2, 0 becomes 2, etc.). He then draws the new matrix on the board.

  6. 20:00 – 25:00 20:00-25:00

    The instructor continues the process of finding the optimal assignment. He performs the line covering again on the newly adjusted matrix. He marks rows with a single zero: row I (0, 6, 0, 6, 6) has a single zero in column A, so he marks row I. Row II (0, 0, 0, 3, 3) has three zeros, so he does not mark it. Row III (0, 0, 0, 0, 3) has four zeros, so he does not mark it. Row IV (0, 1, 1, 0, 0) has two zeros, so he does not mark it. Row V (1, 4, 0, 3, 3) has a single zero in column C, so he marks row V. He then marks columns with a single zero: column A has a zero in row I, so he marks column A. Column C has a zero in row V, so he marks column C. He then marks rows with a zero in a marked column: row I has a zero in column A, so he marks row I (already marked). Row V has a zero in column C, so he marks row V (already marked). He then marks columns with a zero in a marked row: column A has a zero in row I, so he marks column A (already marked). Column C has a zero in row V, so he marks column C (already marked). He draws lines through the unmarked rows and marked columns. He counts the number of lines, which is now five, equal to the number of rows, indicating an optimal assignment has been found.

  7. 25:00 – 27:21 25:00-27:21

    The instructor now identifies the optimal assignment. He looks for a single zero in each row and column. He finds that row I has a single zero in column A, so he assigns job I to worker A. Row II has a single zero in column B, so he assigns job II to worker B. Row III has a single zero in column D, so he assigns job III to worker D. Row IV has a single zero in column E, so he assigns job IV to worker E. Row V has a single zero in column C, so he assigns job V to worker C. He then calculates the total cost by summing the original costs from the initial matrix: I-A (6), II-B (2), III-D (7), IV-E (11), V-C (12). The total cost is 6 + 2 + 7 + 11 + 12 = 38. He writes the final answer on the board.

The video provides a comprehensive, step-by-step walkthrough of the Hungarian Method for solving a minimization assignment problem. It begins with the initial cost matrix and systematically applies the two main reduction steps—Row Reduction and Column Reduction—to transform the matrix into a form where an optimal assignment can be found. The core of the method is the iterative process of covering all zeros with the minimum number of lines. When the number of lines is less than the number of rows, the algorithm adjusts the matrix by finding the smallest uncovered value and using it to modify the matrix elements. This process is repeated until the number of lines equals the number of rows, at which point an optimal assignment is possible. The final step is to identify the unique assignments from the zeros in the matrix and calculate the total cost. The video effectively demonstrates the entire algorithm, from start to finish, making it a valuable resource for understanding this optimization technique.

Loading lesson…