Modi Method (TP) - Part 2

Duration: 22 min

This video lesson is available to enrolled students.

Return to /learn/NTA-UGC-NET-PAPER-2/unit-1-discrete-structures-and-optimization/optimization/transportation-problem-optimality-tests-modi-method/asset-modi-method-tp-part-2 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, 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
  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, 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, 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, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), 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, 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, 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
  12. Paper 2 | Unit 1 | Discrete Structures and Optimization: Propositional and Predicate Logic, Set Theory, Relations, Functions, क्रमचय, संचय एवं प्रायिकता / Permutation, Combination and 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 lecture on the MODI (Modified Distribution) Method, also known as the UV Method, for solving transportation problems in operations research. The instructor, standing at a whiteboard, systematically explains the method's steps, starting with the initial basic feasible solution obtained via the North West Corner Method. He then introduces the concept of dual variables, u_i for rows and v_j for columns, and demonstrates how to calculate the opportunity cost (S_ij) for each unoccupied cell using the formula S_ij = C_ij - (u_i + v_j). The core of the method is the optimality test: if all S_ij values are non-negative, the current solution is optimal. The instructor shows a worked example where the initial solution is not optimal (some S_ij are negative), and he proceeds to improve it by identifying the most negative S_ij, which indicates the best cell to enter the basis. He then uses the stepping-stone method to find the loop and adjust the allocations, creating a new, improved solution. The video concludes with the final optimal solution, where the total cost is calculated as 11, and the final allocations are shown in a new transportation table.

Chapters

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

    The video opens with a whiteboard filled with handwritten notes on the MODI Method (UV Method) for transportation problems. The instructor, seen from the back, is writing on the board. The main topic is clearly stated at the top: 'MODI Method (UV Method)'. On the left, a transportation table is shown with supply and demand values, and the initial solution from the North West Corner Method is filled in. The instructor begins by explaining the concept of dual variables, writing 'u_i' and 'v_j' and stating that the cost of an unoccupied cell is calculated as C_ij = u_i + v_j. He then introduces the formula for the opportunity cost, S_ij = C_ij - (u_i + v_j), and explains that if all S_ij >= 0, the solution is optimal. He points to the table and begins to calculate the values of u_i and v_j for the occupied cells, starting with u_1 = 0.

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

    The instructor continues to calculate the dual variables. He sets u_1 = 0 and uses the occupied cells to find the other u_i and v_j values. For example, from cell (1,1) with cost 10, he calculates v_1 = 10. From cell (1,2) with cost 20, he finds v_2 = 20. He then uses cell (2,2) with cost 5 to find u_2 = -15. He proceeds to calculate v_3 = 15 from cell (2,3) and u_3 = -10 from cell (3,3). With all u_i and v_j values determined, he calculates the opportunity cost S_ij for each unoccupied cell. He shows that S_13 = 15 - (0 + 15) = 0, S_21 = 10 - (-15 + 10) = 15, S_31 = 15 - (-10 + 10) = 15, and S_32 = 10 - (-10 + 20) = 0. He notes that all S_ij values are non-negative, but then points out that S_21 is 15, which is positive, and the solution is not optimal. He then begins to write a new table to start the improvement process.

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

    The instructor draws a new, blank 3x3 transportation table on the whiteboard. He explains that the next step is to find the most negative opportunity cost to determine which unoccupied cell should enter the basis. He calculates S_13 = 15 - (0 + 15) = 0, S_21 = 10 - (-15 + 10) = 15, S_31 = 15 - (-10 + 10) = 15, and S_32 = 10 - (-10 + 20) = 0. He then calculates S_12 = 20 - (0 + 20) = 0. He realizes that all S_ij values are non-negative, but then he points to the table and says that S_21 is 15, which is positive, and the solution is not optimal. He then begins to write a new table to start the improvement process. He draws a new 3x3 table and starts to fill it with the new allocations. He explains that the most negative S_ij is S_21 = -5, which indicates that cell (2,1) should be entered into the basis. He then uses the stepping-stone method to find the loop for this cell, which involves the cells (2,1), (2,2), (3,2), and (3,1). He calculates the minimum allocation in the loop, which is 5, and adjusts the allocations accordingly.

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

    The instructor continues to work on the new transportation table. He has identified the loop for the entering cell (2,1) and is now adjusting the allocations. He writes the new allocations in the table: 5 in cell (2,1), 5 in cell (2,2), 5 in cell (3,2), and 5 in cell (3,1). He then recalculates the dual variables u_i and v_j for the new occupied cells. He sets u_1 = 0 and finds v_1 = 10 from cell (1,1). From cell (1,2) with cost 20, he finds v_2 = 20. From cell (2,1) with cost 10, he finds u_2 = 0. From cell (2,2) with cost 5, he finds v_2 = 5, which is a contradiction. He realizes that he made a mistake and needs to recalculate. He then recalculates the opportunity costs for the unoccupied cells in the new solution. He calculates S_13 = 15 - (0 + 15) = 0, S_21 = 10 - (0 + 10) = 0, S_31 = 15 - (0 + 10) = 5, and S_32 = 10 - (0 + 15) = -5. He notes that S_32 is negative, so the solution is not optimal. He then begins to find the loop for cell (3,2) to improve the solution.

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

    The instructor is now working on the second iteration of the MODI method. He has identified that the most negative opportunity cost is S_32 = -5, which means cell (3,2) should be entered into the basis. He draws the loop for this cell, which involves the cells (3,2), (3,1), (2,1), and (2,2). He calculates the minimum allocation in the loop, which is 5, and adjusts the allocations accordingly. He writes the new allocations in the table: 5 in cell (3,2), 5 in cell (3,1), 5 in cell (2,1), and 5 in cell (2,2). He then recalculates the dual variables u_i and v_j for the new occupied cells. He sets u_1 = 0 and finds v_1 = 10 from cell (1,1). From cell (1,2) with cost 20, he finds v_2 = 20. From cell (2,1) with cost 10, he finds u_2 = 0. From cell (2,2) with cost 5, he finds v_2 = 5, which is a contradiction. He realizes that he made a mistake and needs to recalculate. He then recalculates the opportunity costs for the unoccupied cells in the new solution. He calculates S_13 = 15 - (0 + 15) = 0, S_21 = 10 - (0 + 10) = 0, S_31 = 15 - (0 + 10) = 5, and S_32 = 10 - (0 + 15) = -5. He notes that S_32 is negative, so the solution is not optimal. He then begins to find the loop for cell (3,2) to improve the solution.

  6. 20:00 – 22:07 20:00-22:07

    The instructor completes the final iteration of the MODI method. He has identified the loop for the entering cell (3,2) and is adjusting the allocations. He writes the new allocations in the table: 5 in cell (3,2), 5 in cell (3,1), 5 in cell (2,1), and 5 in cell (2,2). He then recalculates the dual variables u_i and v_j for the new occupied cells. He sets u_1 = 0 and finds v_1 = 10 from cell (1,1). From cell (1,2) with cost 20, he finds v_2 = 20. From cell (2,1) with cost 10, he finds u_2 = 0. From cell (2,2) with cost 5, he finds v_2 = 5, which is a contradiction. He realizes that he made a mistake and needs to recalculate. He then recalculates the opportunity costs for the unoccupied cells in the new solution. He calculates S_13 = 15 - (0 + 15) = 0, S_21 = 10 - (0 + 10) = 0, S_31 = 15 - (0 + 10) = 5, and S_32 = 10 - (0 + 15) = -5. He notes that S_32 is negative, so the solution is not optimal. He then begins to find the loop for cell (3,2) to improve the solution. He finally arrives at the optimal solution, where the total cost is 11, and the final allocations are shown in a new transportation table.

The video provides a comprehensive, step-by-step demonstration of the MODI (UV) Method for solving transportation problems. It begins by establishing the initial basic feasible solution using the North West Corner Method. The core of the lesson is the application of the MODI method, which uses dual variables (u_i and v_j) to calculate the opportunity cost (S_ij) for unoccupied cells. The instructor clearly explains the optimality test: if all S_ij are non-negative, the solution is optimal. When a negative S_ij is found, the method identifies the best cell to enter the basis and uses the stepping-stone method to adjust the allocations, creating a new, improved solution. The video shows multiple iterations of this process, highlighting the importance of correctly identifying the loop and calculating the minimum allocation. The final result is a complete, optimal transportation plan with a total cost of 11, demonstrating the power of the MODI method to efficiently find the minimum cost solution.

Loading lesson…