Optimal Solutions (TP) - Part 2

Duration: 12 min

This video lesson is available to enrolled students.

Return to /learn/MP-SET-COMPUTER-SCIENCE/unit-1-discrete-structures-and-optimization/optimization/transportation-problem-optimality-tests-modi-method/asset-optimal-solutions-tp-part-2 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. 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 / मूल्यांकन प्रणाली
  2. 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 / शोध-प्रबंध एवं लेख लेखन, Application of ICT in Research / अनुसंधान में ICT का अनुप्रयोग, Research Ethics / शोध नैतिकता
  3. 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)
  4. 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 / डिजिटल एवं नव माध्यम, General Awareness (Legacy Paper 1) / सामान्य जागरूकता (पुराना पेपर 1)
  5. 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, Analysis
  6. 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 / वैशेषिक
  7. Paper - 1 | Unit - 7 | Data Interpretation: Data and Graphical Representation / आँकड़े एवं आलेखीय निरूपण, Data Interpretation: Tables / आँकड़ा निर्वचन: तालिका
  8. 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 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 / भौगोलिक संकेतों का संरक्षण
  9. 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 / संक्रामक रोग और प्रतिरक्षण
  10. 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 / स्वतंत्र भारत में शिक्षा आयोग और नीतियाँ, National Education Policy 2020 / राष्ट्रीय शिक्षा नीति 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 / उच्च शिक्षा का नियमन, प्रत्यायन और रैंकिंग, Indian Polity and Governance (Legacy Unit 10) / भारतीय राजव्यवस्था और शासन (पुराना यूनिट 10)
  11. 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
  12. 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
  13. 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
  14. 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
  15. 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
  16. 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
  17. 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
  18. 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
  19. 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, Cloud Computing, Mobile Computing
  20. 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
  21. Full Notes: Paper 1 Full Notes
  22. Paper 1 | Full Mock Tests:
  23. Paper 2 | Full Mock Tests:
  24. Paper 1 | Previous Year Papers:
  25. Paper 2 | Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This video is a lecture on solving a transportation problem in linear programming, specifically using the Vogel's Approximation Method (VAM). The instructor begins by presenting a transportation table with supply and demand values for four sources (Pada, Indore, Ranchi, Pune) and four destinations (Kolkata, Delhi, Mumbai, Chennai). He first reviews the North West Corner method, calculating a total cost of 189,200. He then introduces VAM as a more efficient method to find a better initial basic feasible solution. The instructor demonstrates the VAM process step-by-step: he calculates the penalty for each row and column by finding the difference between the two smallest costs, identifies the row or column with the highest penalty, and allocates as much as possible to the cell with the lowest cost in that row or column. He repeats this process, updating the table and penalties, until all supply and demand are satisfied. The final solution obtained using VAM has a total cost of 140,920, which is significantly lower than the initial solution, illustrating the method's effectiveness.

Chapters

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

    The video opens with a whiteboard displaying a transportation problem titled "Linear Programming Problem" and "Stealing Stone Problem". The instructor, a man in a checkered shirt, stands to the right of the board. He presents a 4x4 transportation table with supply values (200, 160, 160, 90) for sources Pada, Indore, Ranchi, and Pune, and demand values (180, 120, 150, 90) for destinations Kolkata, Delhi, Mumbai, and Chennai. The cost matrix is filled with numbers like 16, 20, 12, etc. The instructor begins by explaining the problem and then calculates the total supply (610) and total demand (540), noting the imbalance. He then proceeds to solve the problem using the North West Corner method, writing the formula for the minimum cost: 180x15 + 20x20 + 100x12 + 60x15 + 90x14 + 40x8 + 100x16 + 10x140 + 10x140. He calculates the total cost as 189,200, which is written as "min (189,200)" on the board.

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

    The instructor introduces the Vogel's Approximation Method (VAM) as a better approach. He begins by drawing a new, empty 4x4 table on the right side of the whiteboard. He then explains the first step of VAM: calculating the penalty for each row and column. The penalty is the difference between the two smallest costs in that row or column. He calculates the penalties for the first row (Kolkata): 20-16=4, for the second row (Delhi): 12-8=4, for the third row (Mumbai): 18-8=10, and for the fourth row (Chennai): 16-9=7. He then calculates the penalties for the columns: Kolkata (16-14=2), Delhi (20-8=12), Mumbai (12-8=4), and Chennai (16-9=7). He identifies the highest penalty, which is 12 in the Delhi column, and allocates the maximum possible amount to the cell with the lowest cost in that column, which is Indore to Delhi (cost 8). He allocates 120 units, satisfying the Delhi demand, and crosses out the Delhi column.

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

    The instructor continues the VAM process. After the first allocation, he recalculates the penalties for the remaining rows and columns. The new penalties are: Pada (16-12=4), Indore (20-16=4), Ranchi (18-16=2), Pune (24-16=8). For the columns: Kolkata (16-14=2), Mumbai (12-12=0), Chennai (16-9=7). The highest penalty is now 8 in the Pune row. He allocates the maximum possible amount to the lowest cost cell in this row, which is Pune to Chennai (cost 9). He allocates 90 units, satisfying the Chennai supply, and crosses out the Pune row. He then recalculates the penalties again. The new penalties are: Pada (16-12=4), Indore (20-16=4), Ranchi (18-16=2). For the columns: Kolkata (16-14=2), Mumbai (12-12=0), Chennai (16-16=0). The highest penalty is 4, which occurs in both Pada and Indore rows. He chooses the Pada row and allocates to the lowest cost cell, Pada to Kolkata (cost 16). He allocates 180 units, satisfying the Kolkata demand, and crosses out the Kolkata column.

  4. 10:00 – 12:28 10:00-12:28

    The instructor completes the VAM solution. With Kolkata and Pune eliminated, he recalculates the penalties. The remaining cells are Indore to Mumbai (20), Ranchi to Mumbai (18), and Ranchi to Chennai (16). The penalties are: Indore (20-16=4), Ranchi (18-16=2). The highest penalty is 4 in the Indore row. He allocates to the lowest cost cell in this row, which is Indore to Mumbai (cost 20). He allocates 160 units, satisfying the Indore supply, and crosses out the Indore row. The only remaining cell is Ranchi to Mumbai (cost 18). He allocates the remaining 150 units to this cell, satisfying the Mumbai demand. The final solution is written as: Pada-Kolkata (180), Indore-Delhi (120), Indore-Mumbai (160), Ranchi-Mumbai (150), Ranchi-Chennai (90). He then calculates the total cost: 180x16 + 120x8 + 160x20 + 150x18 + 90x9 = 2880 + 960 + 3200 + 2700 + 810 = 140,920. He writes "VAM = 140,920" and "C. Method = 6600" on the board, concluding the demonstration.

The video provides a comprehensive, step-by-step demonstration of solving a transportation problem in linear programming. It begins by establishing the problem's parameters and calculating an initial solution using the North West Corner method, which yields a total cost of 189,200. The core of the lecture is the application of the Vogel's Approximation Method (VAM), a more sophisticated heuristic. The instructor meticulously walks through each iteration of VAM, emphasizing the calculation of penalties (the difference between the two smallest costs in a row or column) to prioritize allocations. By always selecting the row or column with the highest penalty and allocating to the cell with the lowest cost, VAM produces a significantly better initial solution with a total cost of 140,920. The video effectively contrasts the two methods, highlighting VAM's superiority in finding a near-optimal starting point for further optimization.

Loading lesson…