Question-2 (Duality) - Part 2

Duration: 20 min

This video lesson is available to enrolled students.

Return to /learn/NTA-UGC-NET-PAPER-2/unit-1-discrete-structures-and-optimization/optimization/duality-example-problems-and-case-analysis/asset-question-2-duality-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, step-by-step tutorial on solving a linear programming problem using the Big M method, a technique for handling constraints with 'greater than or equal to' and 'equality' signs. The instructor begins by presenting the original minimization problem, which includes variables w1, w2, w3, w4, and artificial variables A1, A2. He then explains the need to convert the problem into standard form by introducing slack variables (s1, s2) and artificial variables (A1, A2) to create an initial basic feasible solution. The core of the video involves constructing the initial simplex tableau. The instructor meticulously sets up the tableau with columns for the decision variables, slack variables, artificial variables, and the right-hand side (RHS). He then calculates the initial objective function row (Zj - Cj) by applying the Big M penalty, where the coefficients of the artificial variables in the objective function are set to -M (a very large negative number) to force them out of the basis. The video demonstrates the first iteration of the simplex method, showing the selection of the entering variable (the one with the most negative Zj - Cj value) and the leaving variable (determined by the minimum ratio test). The instructor performs the necessary row operations to pivot and create a new tableau, continuing the process until an optimal solution is reached. The final solution, with the values of the decision variables and the minimum value of the objective function, is clearly presented on the whiteboard.

Chapters

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

    The video opens with a whiteboard displaying the title 'Linear Programming Problem'. The instructor introduces the problem, which is to minimize Z = 10w1 + 6w2 + 2w3 + w4, subject to the constraints w1 + w2 + w3 + w4 ≥ 2 and 2w1 + w2 - w3 - w4 ≥ 1, with all variables being non-negative. The instructor explains that since the constraints are 'greater than or equal to', slack variables (s1, s2) and artificial variables (A1, A2) must be added to convert the problem into standard form. He writes the transformed constraints: w1 + w2 + w3 + w4 - s1 + A1 = 2 and 2w1 + w2 - w3 - w4 - s2 + A2 = 1. He then writes the objective function as Min Z = 10w1 + 6w2 + 2w3 + w4 + 0s1 + 0s2 + MA1 + MA2, explaining that the artificial variables are penalized with a large cost M to ensure they are driven to zero in the optimal solution.

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

    The instructor begins to construct the initial simplex tableau. He writes the variables w1, w2, w3, w4, s1, s2, A1, A2 in the top row. He then fills in the coefficients for the two constraints: the first row is [1, 1, 1, 1, -1, 0, 1, 0, 2] and the second is [2, 1, -1, -1, 0, -1, 0, 1, 1]. He then calculates the initial Zj - Cj row. For the artificial variables A1 and A2, the cost is M, so the Zj values are M and M respectively. The Cj values for A1 and A2 are M, so Zj - Cj is 0. For the slack variables s1 and s2, the cost is 0, so Zj is 0 and Zj - Cj is 0. For the decision variables, the Zj values are calculated as the sum of the product of the basic variable's cost and the column coefficient. For w1, Zj = 0*1 + 0*2 = 0, so Zj - Cj = 0 - 10 = -10. He repeats this for all variables, resulting in the Zj - Cj row: [-10, -6, -2, -1, 0, 0, 0, 0, 0]. He identifies the most negative value, -10, which corresponds to w1, as the entering variable.

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

    The instructor performs the minimum ratio test to determine the leaving variable. He divides the RHS by the coefficients of the entering variable w1. For the first row, 2 / 1 = 2. For the second row, 1 / 2 = 0.5. The minimum ratio is 0.5, so the second row is the pivot row, and A2 is the leaving variable. He then performs the pivot operation. The pivot element is 2. He divides the second row by 2 to make the pivot element 1, resulting in [1, 0.5, -0.5, -0.5, 0, -0.5, 0, 0.5, 0.5]. He then uses this new row to eliminate w1 from the other rows. For the first row, he subtracts the new row from it: [1, 1, 1, 1, -1, 0, 1, 0, 2] - [1, 0.5, -0.5, -0.5, 0, -0.5, 0, 0.5, 0.5] = [0, 0.5, 1.5, 1.5, -1, 0.5, 1, -0.5, 1.5]. For the Zj - Cj row, he adds 10 times the new row to it: [-10, -6, -2, -1, 0, 0, 0, 0, 0] + 10*[1, 0.5, -0.5, -0.5, 0, -0.5, 0, 0.5, 0.5] = [0, -1, -7, -6, 0, -5, 0, 5, 5]. The new Zj - Cj row is [0, -1, -7, -6, 0, -5, 0, 5, 5]. He identifies the most negative value, -7, which corresponds to w3, as the new entering variable.

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

    The instructor performs the minimum ratio test for the new entering variable w3. He divides the RHS by the coefficients of w3. For the first row, 1.5 / 1.5 = 1. For the second row, 0.5 / (-0.5) = -1. Since the ratio must be positive, only the first row is considered. The minimum ratio is 1, so the first row is the pivot row, and A1 is the leaving variable. He performs the pivot operation. The pivot element is 1.5. He divides the first row by 1.5 to make the pivot element 1, resulting in [0, 1/3, 1, 1, -2/3, 1/3, 2/3, -1/3, 1]. He then uses this new row to eliminate w3 from the other rows. For the second row, he adds 0.5 times the new row to it: [1, 0.5, -0.5, -0.5, 0, -0.5, 0, 0.5, 0.5] + 0.5*[0, 1/3, 1, 1, -2/3, 1/3, 2/3, -1/3, 1] = [1, 2/3, 0, 0, -1/3, -1/3, 1/3, 1/3, 1]. For the Zj - Cj row, he adds 7 times the new row to it: [0, -1, -7, -6, 0, -5, 0, 5, 5] + 7*[0, 1/3, 1, 1, -2/3, 1/3, 2/3, -1/3, 1] = [0, 4/3, 0, 1, -14/3, -8/3, 14/3, -2/3, 12]. The new Zj - Cj row is [0, 4/3, 0, 1, -14/3, -8/3, 14/3, -2/3, 12]. He identifies the most negative value, -14/3, which corresponds to s1, as the new entering variable.

  5. 15:00 – 19:53 15:00-19:53

    The instructor performs the minimum ratio test for the new entering variable s1. He divides the RHS by the coefficients of s1. For the first row, 1 / (-2/3) = -1.5. For the second row, 1 / (-1/3) = -3. Since both ratios are negative, there is no positive ratio, which indicates that the problem is unbounded. However, the instructor continues the process. He identifies the pivot element as -2/3 in the first row. He divides the first row by -2/3 to make the pivot element 1, resulting in [0, -1/2, -3/2, -3/2, 1, -1/2, -1, 1/2, -3/2]. He then uses this new row to eliminate s1 from the other rows. For the second row, he adds 1/3 times the new row to it: [1, 2/3, 0, 0, -1/3, -1/3, 1/3, 1/3, 1] + (1/3)*[0, -1/2, -3/2, -3/2, 1, -1/2, -1, 1/2, -3/2] = [1, 1/2, -1/2, -1/2, 0, -1/2, 2/3, 1/2, 1/2]. For the Zj - Cj row, he adds 14/3 times the new row to it: [0, 4/3, 0, 1, -14/3, -8/3, 14/3, -2/3, 12] + (14/3)*[0, -1/2, -3/2, -3/2, 1, -1/2, -1, 1/2, -3/2] = [0, -1/3, -7, -6, 0, -5, 0, 5, 5]. The new Zj - Cj row is [0, -1/3, -7, -6, 0, -5, 0, 5, 5]. The instructor then identifies the most negative value, -7, which corresponds to w3, as the entering variable. He performs the minimum ratio test again, and the process continues. The final solution is not reached in the video, but the instructor shows the final tableau with the optimal solution. The optimal solution is w1 = 0, w2 = 0, w3 = 1, w4 = 0, s1 = 0, s2 = 0, A1 = 0, A2 = 0, and the minimum value of Z is 2.

The video provides a comprehensive, step-by-step walkthrough of the Big M method for solving a linear programming problem. It begins with the formulation of the problem, highlighting the need for artificial variables to handle 'greater than or equal to' constraints. The instructor then systematically constructs the initial simplex tableau, carefully calculating the Zj - Cj row with the large penalty M. The core of the lesson is the iterative simplex process, where the instructor demonstrates the selection of entering and leaving variables using the minimum ratio test and performs the necessary row operations to pivot. The video illustrates the entire process of transforming the initial tableau into a final optimal tableau, showcasing the power of the simplex method to find the optimal solution to a complex optimization problem.

Loading lesson…