Two Phase Method - Part 2

Duration: 14 min

This video lesson is available to enrolled students.

Return to /learn/NTA-UGC-NET-PAPER-2/unit-1-discrete-structures-and-optimization/optimization/two-phase-method-feasibility-computation-optimality-computation/asset-two-phase-method-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.

The video is a lecture on solving a linear programming problem using the Two Phase Method, a technique for handling constraints that do not have an initial basic feasible solution. The instructor begins by presenting the problem, which includes an objective function to maximize and a set of constraints. He explains that the standard Simplex Method cannot be applied directly because the constraints are of the 'greater than or equal to' type, which prevents the immediate identification of a basic feasible solution. To overcome this, he introduces the Two Phase Method. In Phase I, an auxiliary objective function is created to minimize the sum of artificial variables (A1), with the goal of driving this sum to zero. The instructor sets up the initial simplex tableau for Phase I, showing the coefficients of the variables, including the artificial variable A1, and the right-hand side values. He then demonstrates the first iteration of the Simplex Method, identifying the entering variable (the one with the most negative coefficient in the objective row) and the leaving variable (determined by the minimum ratio test). The pivot element is identified, and the instructor proceeds to perform row operations to create a new tableau. The process continues, with the instructor updating the tableau, calculating new values, and checking for optimality. The video shows the step-by-step progression of the algorithm, including the calculation of ratios and the updating of the solution vector. The instructor's goal is to find a feasible solution where the artificial variable A1 is zero, indicating that a basic feasible solution has been found for the original problem. The video concludes with the final tableau of Phase I, setting the stage for Phase II, where the original objective function is optimized using the feasible basis found in Phase I.

Chapters

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

    The video opens with a whiteboard displaying a linear programming problem. The instructor, standing to the right, begins to explain the problem. The objective is to maximize Z = 5x1 - x2 + 3x3, subject to the constraints: 2x1 + x2 - x3 = 20, 6x1 + 5x2 + 10x3 = 76, and 8x1 - 3x2 + 6x3 = 50, with all variables being non-negative. The instructor notes that the constraints are of the 'greater than or equal to' type, which means the standard Simplex Method cannot be applied directly because there is no initial basic feasible solution. He introduces the Two Phase Method as a solution. The first step is to create an auxiliary problem to find a basic feasible solution. The objective for Phase I is to minimize Z' = A1, where A1 is an artificial variable. The instructor writes the initial simplex tableau for Phase I, with the objective row showing coefficients for the variables x1, x2, x3, A1, S1, S2, S3, and the solution column. The tableau shows the coefficients of the constraints and the right-hand side values. The instructor points to the tableau, explaining that the goal is to make the artificial variable A1 zero, which would mean a feasible solution has been found for the original problem.

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

    The instructor continues to work on the Phase I simplex tableau. He identifies the entering variable by looking for the most negative coefficient in the objective row (Z' - A1). The coefficient for A1 is -1, which is the most negative, so A1 is the entering variable. He then performs the minimum ratio test to determine the leaving variable. The ratios are calculated by dividing the right-hand side (Soln) by the corresponding coefficient in the A1 column. The ratios are 20/2 = 10, 76/5 = 15.2, and 50/(-3) = -16.67. The minimum positive ratio is 10, which corresponds to the first row. Therefore, S1 is the leaving variable. The pivot element is the intersection of the A1 column and the S1 row, which is 2. The instructor circles this pivot element. He then begins to perform row operations to make the pivot element 1 and to eliminate the other entries in the A1 column. He divides the first row by 2 to make the pivot element 1. The new first row becomes: 1, 0.5, -0.5, 1, 0, 0, 0, 10. He then uses this new row to eliminate the A1 coefficient in the other rows. For the second row, he subtracts 5 times the new first row from the original second row. For the third row, he adds 3 times the new first row to the original third row. The instructor writes down the new values for the second and third rows, updating the tableau.

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

    The instructor has updated the tableau after the first iteration of Phase I. He now checks for optimality. The objective row (Z' - A1) has coefficients: 0, 0.5, -0.5, 0, 0, 0, 0, 10. Since there is a negative coefficient (-0.5) in the x3 column, the solution is not optimal, and another iteration is needed. The entering variable is x3. He performs the minimum ratio test for x3. The ratios are 10 / (-0.5) = -20, 76 / 10 = 7.6, and 50 / 6 = 8.33. The minimum positive ratio is 7.6, which corresponds to the second row. Therefore, S2 is the leaving variable. The pivot element is the intersection of the x3 column and the S2 row, which is 10. The instructor circles this pivot element. He then performs row operations. He divides the second row by 10 to make the pivot element 1. The new second row becomes: 0, 0.5, 1, 0, 0.1, 0, 0, 7.6. He then uses this new row to eliminate the x3 coefficient in the other rows. For the first row, he adds 0.5 times the new second row to the original first row. For the objective row, he adds 0.5 times the new second row to the original objective row. The instructor writes down the new values for the first row and the objective row, updating the tableau. He then checks for optimality again. The objective row now has coefficients: 0, 0.75, 0, 0, 0.05, 0, 0, 13.8. Since all coefficients are non-negative, the solution is optimal for Phase I. The value of the artificial variable A1 is 0, which means a basic feasible solution has been found for the original problem.

  4. 10:00 – 14:02 10:00-14:02

    The instructor now transitions to Phase II of the Two Phase Method. He removes the artificial variable A1 and its column from the tableau, as it is no longer needed. He also removes the Phase I objective row (Z' - A1) and replaces it with the original objective function, Z = 5x1 - x2 + 3x3. The new objective row is: 0, 0, 0, 0, 0, 0, 0, 0, but with the coefficients of the original objective function. The instructor writes the new objective row as: 5, -1, 3, 0, 0, 0, 0, 0. He then checks for optimality. The coefficients in the objective row are: 5, -1, 3, 0, 0, 0, 0. Since there are negative coefficients (-1 and 3), the solution is not optimal. The entering variable is x2 (the one with the most negative coefficient). He performs the minimum ratio test for x2. The ratios are 10 / 0.5 = 20, 7.6 / 0.5 = 15.2, and 50 / 1 = 50. The minimum positive ratio is 15.2, which corresponds to the second row. Therefore, S2 is the leaving variable. The pivot element is the intersection of the x2 column and the S2 row, which is 0.5. The instructor circles this pivot element. He then performs row operations. He divides the second row by 0.5 to make the pivot element 1. The new second row becomes: 0, 1, 2, 0, 0.2, 0, 0, 15.2. He then uses this new row to eliminate the x2 coefficient in the other rows. For the first row, he subtracts 0.5 times the new second row from the original first row. For the objective row, he adds 1 times the new second row to the original objective row. The instructor writes down the new values for the first row and the objective row, updating the tableau. He then checks for optimality again. The objective row now has coefficients: 5, 0, 5, 0, 0.2, 0, 0, 15.2. Since all coefficients are non-negative, the solution is optimal. The optimal solution is x1 = 0, x2 = 15.2, x3 = 0, and the maximum value of Z is 15.2.

The video provides a comprehensive, step-by-step demonstration of the Two Phase Method for solving a linear programming problem. It begins by identifying the challenge of an initial infeasible solution due to 'greater than or equal to' constraints. The method is broken down into two distinct phases. Phase I is dedicated to finding a basic feasible solution by minimizing the sum of artificial variables. The instructor meticulously walks through the first iteration of the Simplex Method, identifying the pivot element, performing row operations, and checking for optimality. The process is repeated until the artificial variable is driven to zero, confirming a feasible solution. The video then transitions to Phase II, where the original objective function is optimized using the feasible basis found in Phase I. The instructor demonstrates the final iteration, showing how the optimal solution is reached. The entire process is illustrated on a whiteboard, with clear labeling of the tableau, variables, and calculations, making it an excellent educational resource for understanding this advanced optimization technique.

Loading lesson…