Канал: MathVerseMBA-MCA

Hungarian Method||Balanced Assignment Problem||LPP||In Hindi

Hungarian Method||Balanced Assignment Problem||LPP||In Hindi

Unbalanced Assignment Problem||Hungarian Method||LPP||In Hindi

Unbalanced Assignment Problem||Hungarian Method||LPP||In Hindi

Northwest Corner Cell Method||Balanced Transportation Problem||Finding IBFS||In Hindi

Northwest Corner Cell Method||Balanced Transportation Problem||Finding IBFS||In Hindi

Construction of Network Diagrams||Dummy Activity||Concurrent Activity||Operations Research

Construction of Network Diagrams||Dummy Activity||Concurrent Activity||Operations Research

Construction of Network Diagrams||Full Explanation||Project Management||Operations Research

Construction of Network Diagrams||Full Explanation||Project Management||Operations Research

PERT(Project Evaluation and Review Technique)||Operations Research||In Hindi

PERT(Project Evaluation and Review Technique)||Operations Research||In Hindi

Vogel's Approximation Method(VAM)||Balanced Transportation Problem||Optimization Techniques

Vogel's Approximation Method(VAM)||Balanced Transportation Problem||Optimization Techniques

Least Cost Cell Method||Balanced Transportation Problem||Optimization Techniques||In Hindi

Least Cost Cell Method||Balanced Transportation Problem||Optimization Techniques||In Hindi

Balanced Assignment Problem: Hungarian Method||Operations Research||Optimum Solution||In Hindi

Balanced Assignment Problem: Hungarian Method||Operations Research||Optimum Solution||In Hindi

Replacement Model||Maintenance Cost and value of money changes with time||Operations Research

Replacement Model||Maintenance Cost and value of money changes with time||Operations Research

Replacement Model||Finding Optimum Replacement period when different resale values are given

Replacement Model||Finding Optimum Replacement period when different resale values are given

Replacement Model||Operations Research||Replacement Theory||In Hindi

Replacement Model||Operations Research||Replacement Theory||In Hindi

Big-M Method: Maximization Problem||Charne's Big-M Method||LPP||Optimization Techniques||In Hindi

Big-M Method: Maximization Problem||Charne's Big-M Method||LPP||Optimization Techniques||In Hindi

Big-M Method: Maximization Problem||Charne's Big-M Method||LPP||Optimization Techniques||In Hindi

Big-M Method: Maximization Problem||Charne's Big-M Method||LPP||Optimization Techniques||In Hindi

Game Theory||Dominance Property with Mixed Strategy||Optimization Techniques||In Hindi

Game Theory||Dominance Property with Mixed Strategy||Optimization Techniques||In Hindi

Game Theory||Example of Dominance Property||Operations Research||Optimization Techniques||In Hindi

Game Theory||Example of Dominance Property||Operations Research||Optimization Techniques||In Hindi

Game Theory||Operations Research||Pure and Mixed Strategy Examples||Optimization Techniques

Game Theory||Operations Research||Pure and Mixed Strategy Examples||Optimization Techniques

Game Theory||Operations Research||Terminologies of Game Theory||Optimization Techniques||In Hindi

Game Theory||Operations Research||Terminologies of Game Theory||Optimization Techniques||In Hindi

Northwest Corner Cell Method||Balanced Transportation Problem||Optimization Techniques||In Hindi

Northwest Corner Cell Method||Balanced Transportation Problem||Optimization Techniques||In Hindi

Northwest Corner Cell Method||Balanced Transportation Problem||Optimization Techniques||In Hindi

Northwest Corner Cell Method||Balanced Transportation Problem||Optimization Techniques||In Hindi

Mathematical Logic||Statement Form||Symbolic Form||Discrete Mathematics||In Hindi

Mathematical Logic||Statement Form||Symbolic Form||Discrete Mathematics||In Hindi

Mathematical Logic||Contingent & Contradiction||Logical Connectives||Discrete Mathematics||In Hindi

Mathematical Logic||Contingent & Contradiction||Logical Connectives||Discrete Mathematics||In Hindi

Mathematical Logic||Tautology||Logical Connectives||Discrete Mathematics||In Hindi

Mathematical Logic||Tautology||Logical Connectives||Discrete Mathematics||In Hindi

Logical Connectives||Mathematical Logic||Truth Tables||Equivalence||Discrete Mathematics||In Hindi

Logical Connectives||Mathematical Logic||Truth Tables||Equivalence||Discrete Mathematics||In Hindi

Mathematical Logic||Discrete Mathematics||Converse; Inverse; Contrapositive||In Hindi

Mathematical Logic||Discrete Mathematics||Converse; Inverse; Contrapositive||In Hindi

Discrete Mathematics||Mathematical Logic||Logical Connectives||Propositions||Notations||Truth Tables

Discrete Mathematics||Mathematical Logic||Logical Connectives||Propositions||Notations||Truth Tables

Simplex Method||Linear Programming Problems||Optimization Techniques||In Hindi

Simplex Method||Linear Programming Problems||Optimization Techniques||In Hindi

Sequential Model||Processing N Jobs through M Machines||Example 1||In Hindi

Sequential Model||Processing N Jobs through M Machines||Example 1||In Hindi

Sequential Model||Processing n Jobs through 3 Machines||Example 1||In Hindi

Sequential Model||Processing n Jobs through 3 Machines||Example 1||In Hindi

Sequential Model||Processing n Jobs through 2 Machines||Example 2||In Hindi

Sequential Model||Processing n Jobs through 2 Machines||Example 2||In Hindi

Sequential Model||Processing n Jobs through 2 Machines||Example 1||In Hindi

Sequential Model||Processing n Jobs through 2 Machines||Example 1||In Hindi

Least Cost Cell Method(Matrix Minima Method)||Balanced Transportation Problem||Operations Research

Least Cost Cell Method(Matrix Minima Method)||Balanced Transportation Problem||Operations Research

Vogel's Approximation Method(VAM)||Balanced Transportation Problem||Operations Research||In Hindi

Vogel's Approximation Method(VAM)||Balanced Transportation Problem||Operations Research||In Hindi

CPM: Critical Path method||Network Diagram||Critical Path||Optimization Techniques

CPM: Critical Path method||Network Diagram||Critical Path||Optimization Techniques

Two Phase Simplex Method: Minimization Problem||Example 6||LPP||Operations Research

Two Phase Simplex Method: Minimization Problem||Example 6||LPP||Operations Research

PERT: Project Evaluation and Review Technique||Operations Research||Project Management Techniques

PERT: Project Evaluation and Review Technique||Operations Research||Project Management Techniques

Northwest Corner Cell Method||Balanced Transportation Problem||Example 2 ||In Hindi

Northwest Corner Cell Method||Balanced Transportation Problem||Example 2 ||In Hindi

Graph Theory||Prim's, Kruskal's & Dijkstra's Algorithms||Minimal Spanning Tree||Example 18||In Hindi

Graph Theory||Prim's, Kruskal's & Dijkstra's Algorithms||Minimal Spanning Tree||Example 18||In Hindi

Graph Theory||Prim's, Kruskal's & Dijkstra's Algorithms||Minimal Spanning Tree||Example 17||In Hindi

Graph Theory||Prim's, Kruskal's & Dijkstra's Algorithms||Minimal Spanning Tree||Example 17||In Hindi

Graph Theory||Dijkstra's Algorithm||Weighted Graph||Example 16||Discrete Mathematics||In Hindi

Graph Theory||Dijkstra's Algorithm||Weighted Graph||Example 16||Discrete Mathematics||In Hindi

Graph Theory||Dijkstra's Algorithm||Weighted Graph||Example 15||Discrete Mathematics||In Hindi

Graph Theory||Dijkstra's Algorithm||Weighted Graph||Example 15||Discrete Mathematics||In Hindi

Graph Theory||Finding Shortest Path using Dijkstra's Algorithm||Discrete Mathematics||Example 14

Graph Theory||Finding Shortest Path using Dijkstra's Algorithm||Discrete Mathematics||Example 14

Graph Theory||Graph Coloring & Chromatic Number of Graph||Discrete Mathematics||Example 13||In Hindi

Graph Theory||Graph Coloring & Chromatic Number of Graph||Discrete Mathematics||Example 13||In Hindi

Graph Theory||Hamiltonian Graph, Path & Circuit||Eulerian Graph & Circuit||Example 12||In Hindi

Graph Theory||Hamiltonian Graph, Path & Circuit||Eulerian Graph & Circuit||Example 12||In Hindi

Graph Theory||Kruskal's Algorithm||Prim's Algorithm||Minimal Spanning Tree||Example 11||In Hindi

Graph Theory||Kruskal's Algorithm||Prim's Algorithm||Minimal Spanning Tree||Example 11||In Hindi

Simplex Method||Maximization Problem||Linear Programming Problems||Example 1||In Hindi

Simplex Method||Maximization Problem||Linear Programming Problems||Example 1||In Hindi

Graph Theory||Minimal Spanning Tree||Kruskal's & PRIM's Algorithms||Discrete Mathematics||In Hindi

Graph Theory||Minimal Spanning Tree||Kruskal's & PRIM's Algorithms||Discrete Mathematics||In Hindi

Graph Theory||Eulerian & Hamiltonian Graph and Circuit||Discrete Mathematics||Example 9||In Hindi

Graph Theory||Eulerian & Hamiltonian Graph and Circuit||Discrete Mathematics||Example 9||In Hindi

Graph Theory||Spanning Tree||Tree with n vertices has n-1 edges||Eulerian Graph||Hamiltonian Graph

Graph Theory||Spanning Tree||Tree with n vertices has n-1 edges||Eulerian Graph||Hamiltonian Graph

Graph Theory||Binary Tree & Spanning Tree||Discrete Mathematics||Example 7||In Hindi

Graph Theory||Binary Tree & Spanning Tree||Discrete Mathematics||Example 7||In Hindi

Graph Theory||Eulerian and Hamiltonian Graph||Example 6||Discrete Mathematics||In Hindi

Graph Theory||Eulerian and Hamiltonian Graph||Example 6||Discrete Mathematics||In Hindi

Graph Theory||Isomorphism of Graphs||Discrete Mathematics||Example 5||In Hindi

Graph Theory||Isomorphism of Graphs||Discrete Mathematics||Example 5||In Hindi

Graph Theory||Isomorphism of Graphs||Discrete Mathematics||Example 4||In Hindi

Graph Theory||Isomorphism of Graphs||Discrete Mathematics||Example 4||In Hindi

Graph Theory||Types of Graphs||Discrete Mathematics||Example 3||In Hindi

Graph Theory||Types of Graphs||Discrete Mathematics||Example 3||In Hindi

Graph Theory||Adjacency and Incident Matrix||Discrete Mathematics||Example 2||In Hindi

Graph Theory||Adjacency and Incident Matrix||Discrete Mathematics||Example 2||In Hindi

Discrete Mathematics||Graph Theory||Adjacency and Incident Matrix||Example 1||In Hindi

Discrete Mathematics||Graph Theory||Adjacency and Incident Matrix||Example 1||In Hindi

Job Sequencing||Processing N Jobs through K Machines||Sequential Model||Example 3||OT

Job Sequencing||Processing N Jobs through K Machines||Sequential Model||Example 3||OT

Job Sequencing||Processing N Jobs through K Machines||Sequential Model||Example 2||OT

Job Sequencing||Processing N Jobs through K Machines||Sequential Model||Example 2||OT

Job Sequencing||Processing N Jobs through K Machines||Sequential Model||Optimization Techniques

Job Sequencing||Processing N Jobs through K Machines||Sequential Model||Optimization Techniques

Job Sequencing||Processing N Jobs through 2 & 3 Machines||Sequential Model||Optimization Techniques

Job Sequencing||Processing N Jobs through 2 & 3 Machines||Sequential Model||Optimization Techniques

Mathematical Logic||Logical Connectives||Discrete Mathematics||Equivalence||Truth Table

Mathematical Logic||Logical Connectives||Discrete Mathematics||Equivalence||Truth Table

Logical Connectives||Converting statements into Symbolic form||Discrete Mathematics||In Hindi

Logical Connectives||Converting statements into Symbolic form||Discrete Mathematics||In Hindi

Check whether given implication is contingent or contradiction||Discrete Mathematics||Truth Tables

Check whether given implication is contingent or contradiction||Discrete Mathematics||Truth Tables

Discrete Mathematics||Mathematical Logic||Logical Connectives||Test for Tautology||Truth Tables

Discrete Mathematics||Mathematical Logic||Logical Connectives||Test for Tautology||Truth Tables

Discrete Mathematics||Mathematical Logic| Implications and equivalence of statements

Discrete Mathematics||Mathematical Logic| Implications and equivalence of statements

Discrete Mathematics||Converse||Inverse||Contrapositive||Mathematical Logic||Notations||Examples

Discrete Mathematics||Converse||Inverse||Contrapositive||Mathematical Logic||Notations||Examples

Discrete Mathematics||Mathematical Logic||Logical Connectives||Propositions||Notations||Truth Tables

Discrete Mathematics||Mathematical Logic||Logical Connectives||Propositions||Notations||Truth Tables

Northwest Corner Cell Method||Balanced Transportation Problem||Operations Research||In Hindi

Northwest Corner Cell Method||Balanced Transportation Problem||Operations Research||In Hindi

Least Cost Cell Method||Balanced Transportation Problem||Operations Research||In Hindi

Least Cost Cell Method||Balanced Transportation Problem||Operations Research||In Hindi

Northwest Corner Cell Method||Balanced Transportation Problem||Operations Research||In Hindi

Northwest Corner Cell Method||Balanced Transportation Problem||Operations Research||In Hindi

Job Sequencing | Processing N jobs through 3 machines | Operations Research |Optimization Techniques

Job Sequencing | Processing N jobs through 3 machines | Operations Research |Optimization Techniques

Job Sequencing | Processing N jobs through 3 machines | Operations Research |Optimization Techniques

Job Sequencing | Processing N jobs through 3 machines | Operations Research |Optimization Techniques

Job Sequencing||Processing N jobs through 2 machines||Example 10||Operations Research||In Hindi

Job Sequencing||Processing N jobs through 2 machines||Example 10||Operations Research||In Hindi

Job Sequencing||Processing N jobs through 2 machines||Example 9||Operations Research||In Hindi

Job Sequencing||Processing N jobs through 2 machines||Example 9||Operations Research||In Hindi

Job Sequencing||Processing N jobs through 2 machines||Example 8||Operations Research||In Hindi

Job Sequencing||Processing N jobs through 2 machines||Example 8||Operations Research||In Hindi

Dual Simplex Method||Maximization Problem||Operation Research||Decision Science||In Hindi

Dual Simplex Method||Maximization Problem||Operation Research||Decision Science||In Hindi

Dual Simplex Method||Infeasible Solution||Maximization Problem||Operation Research||Decision Science

Dual Simplex Method||Infeasible Solution||Maximization Problem||Operation Research||Decision Science

Two Phase Simplex Method||Example 7||LPP||Operations Research||Decision Science||In Hindi

Two Phase Simplex Method||Example 7||LPP||Operations Research||Decision Science||In Hindi

Two Phase Simplex Method with no Feasible Solution||Example 7||LPP||Operations Research

Two Phase Simplex Method with no Feasible Solution||Example 7||LPP||Operations Research

Dual Simplex Method||Maximization Problem||Operation Research||Decision Science||In Hindi

Dual Simplex Method||Maximization Problem||Operation Research||Decision Science||In Hindi

Dual Simplex Method||Minimization Problem||Operation Research||Decision Science||In Hindi

Dual Simplex Method||Minimization Problem||Operation Research||Decision Science||In Hindi

Charne's Big-M Method(Penalty Method):Maximization Problem||Steps of Big-M Method||In Hindi

Charne's Big-M Method(Penalty Method):Maximization Problem||Steps of Big-M Method||In Hindi

Two Phase Simplex Method for no feasible optimal solution||Example 6||LPP||Operations Research

Two Phase Simplex Method for no feasible optimal solution||Example 6||LPP||Operations Research

Simplex Method: Minimization Problem||Example 5||Decision Science||In Hindi

Simplex Method: Minimization Problem||Example 5||Decision Science||In Hindi

Probability||Decision Science||Definitions||Theorems||Solved Examples||In Hindi

Probability||Decision Science||Definitions||Theorems||Solved Examples||In Hindi

Mathematical Expectation & Variance of Continuous Random Variables||Example 3||In Hindi

Mathematical Expectation & Variance of Continuous Random Variables||Example 3||In Hindi

Network Diagrams||Making table from the given information||Most Important Example||In Hindi

Network Diagrams||Making table from the given information||Most Important Example||In Hindi

PERT: Project Evaluation and Review Technique||Example 6||Operations Research||In Hindi

PERT: Project Evaluation and Review Technique||Example 6||Operations Research||In Hindi

Critical Path Method (CPM)||Example 2||Project Management Technique||Operations Research||In Hindi

Critical Path Method (CPM)||Example 2||Project Management Technique||Operations Research||In Hindi

Critical Path Method(CPM)||Operations Research||In Hindi

Critical Path Method(CPM)||Operations Research||In Hindi

Network Diagrams||Dummy activity||Operations Research||In Hindi

Network Diagrams||Dummy activity||Operations Research||In Hindi

Transportation Problems||Dummy Activity||Northwest Corner Method||Least Cost Method||VAM Method

Transportation Problems||Dummy Activity||Northwest Corner Method||Least Cost Method||VAM Method

Random Variables and Mathematical Expression||Continuous Probability Distribution||P&C||In Hindi

Random Variables and Mathematical Expression||Continuous Probability Distribution||P&C||In Hindi

PERT: Project Evaluation and Review Technique||Example 5||Operations Research||In Hindi

PERT: Project Evaluation and Review Technique||Example 5||Operations Research||In Hindi

Sequential Model||Processing N jobs through 2 machines||Operations Research||In Hindi

Sequential Model||Processing N jobs through 2 machines||Operations Research||In Hindi

PERT(Project Evaluation and Review Technique)||Example 4||Operations Research||In Hindi

PERT(Project Evaluation and Review Technique)||Example 4||Operations Research||In Hindi

Discrete Random Variable and Mathematical Expectation||Probability and Combinatorics||In Hindi

Discrete Random Variable and Mathematical Expectation||Probability and Combinatorics||In Hindi

Bernoulli Distribution||Special Discrete Probability Distributions||Example 1||Operations Research

Bernoulli Distribution||Special Discrete Probability Distributions||Example 1||Operations Research

Multinomial Theorem: Finding Coefficient of given expression||Decision Science||In Hindi

Multinomial Theorem: Finding Coefficient of given expression||Decision Science||In Hindi

Crashing of Project Network||Crashing Single Critical Path with Total Float||Part 1

Crashing of Project Network||Crashing Single Critical Path with Total Float||Part 1

Critical Path Method (CPM)||Project Management Technique||Operations Research||In Hindi

Critical Path Method (CPM)||Project Management Technique||Operations Research||In Hindi

Two Phase Simplex Method||Example 4||LPP||Operations Research||In Hindi

Two Phase Simplex Method||Example 4||LPP||Operations Research||In Hindi

Two Phase Simplex Method: Minimization Problem||Example 3||LPP||Operations Research

Two Phase Simplex Method: Minimization Problem||Example 3||LPP||Operations Research

Graphical Method in LPP||Maximization Problem||Lecture 5||Operations Research||In Hindi

Graphical Method in LPP||Maximization Problem||Lecture 5||Operations Research||In Hindi

Graphical Method in LPP||Minimization Problem||Lecture 4||Operations Research||In Hindi

Graphical Method in LPP||Minimization Problem||Lecture 4||Operations Research||In Hindi

Sequential Model with Tie Cases: N jobs through 2 Machines||Job Sequencing||Operations Research

Sequential Model with Tie Cases: N jobs through 2 Machines||Job Sequencing||Operations Research

Sequential Model:N jobs through 2 Machines||Job Sequencing||Operations Research||Lecture 5||In Hindi

Sequential Model:N jobs through 2 Machines||Job Sequencing||Operations Research||Lecture 5||In Hindi

PERT(Project Evaluation and Review Technique)||Operations Research||Example 3||In Hindi

PERT(Project Evaluation and Review Technique)||Operations Research||Example 3||In Hindi

Vogel's Approximation Method to solve balanced Transportation Problem||VAM Method||Example 2

Vogel's Approximation Method to solve balanced Transportation Problem||VAM Method||Example 2

Least Cost Cell Method(Matrix Minima Method)||Balanced Transportation Problem||In Hindi

Least Cost Cell Method(Matrix Minima Method)||Balanced Transportation Problem||In Hindi

Northwest Corner Cell Method in Transportation Problems||Balanced Transportation Problem||In Hindi

Northwest Corner Cell Method in Transportation Problems||Balanced Transportation Problem||In Hindi

Game Theory||Dominance Property explanation||Mixed strategy example||Operations Research||In Hindi

Game Theory||Dominance Property explanation||Mixed strategy example||Operations Research||In Hindi

Game Theory||Dominance Property explanation||Pure strategy example||Operations Research||In Hindi

Game Theory||Dominance Property explanation||Pure strategy example||Operations Research||In Hindi

Game Theory||Operations Research||Pure and Mixed Strategy Examples||In Hindi

Game Theory||Operations Research||Pure and Mixed Strategy Examples||In Hindi

Big-M Method: Maximization Problem||Charne's Big-M Method||LPP||Example 2||In Hindi

Big-M Method: Maximization Problem||Charne's Big-M Method||LPP||Example 2||In Hindi

Game Theory||Operations Research||Basic Terminologies||Types of games||Strategy||In Hindi

Game Theory||Operations Research||Basic Terminologies||Types of games||Strategy||In Hindi

Big-M Method: Maximization Problem||Charne's Big-M Method||LPP||Example 1||In Hindi

Big-M Method: Maximization Problem||Charne's Big-M Method||LPP||Example 1||In Hindi

Simplex Method: Maximization Problem||LPP||Example 2||In Hindi

Simplex Method: Maximization Problem||LPP||Example 2||In Hindi

Network Diagrams||Easiest way to draw Network Diagrams||In Hindi

Network Diagrams||Easiest way to draw Network Diagrams||In Hindi

Simplex Method: Maximization Problem||LPP||Example 1||In Hindi

Simplex Method: Maximization Problem||LPP||Example 1||In Hindi

Lecture 6: Hungarian Method to solve Simple Assignment Problem || Optimal Solution ||

Lecture 6: Hungarian Method to solve Simple Assignment Problem || Optimal Solution ||

Replacement Model: When maintenance cost and value of money changes with time||

Replacement Model: When maintenance cost and value of money changes with time||

PERT: Finding Variance, Expected Duration and Standard Deviation of the Critical Path||

PERT: Finding Variance, Expected Duration and Standard Deviation of the Critical Path||

Computation of Forward Pass, Backward Pass, EFT, EST, LFT and LST||Critical Path Method(CPM)

Computation of Forward Pass, Backward Pass, EFT, EST, LFT and LST||Critical Path Method(CPM)

Replacement Model: Finding Optimum Replacement period when different resale values are given||

Replacement Model: Finding Optimum Replacement period when different resale values are given||

Replacement Model: Replacement of item when the money value does not change with time||

Replacement Model: Replacement of item when the money value does not change with time||

Crashing of Project Network with two Critical paths In Operations Research||Network Diagram||

Crashing of Project Network with two Critical paths In Operations Research||Network Diagram||

PERT||Project Evaluation & Review Technique|| Operations Research||

PERT||Project Evaluation & Review Technique|| Operations Research||

Network Diagrams||With Special Case and Dummy Activity Examples

Network Diagrams||With Special Case and Dummy Activity Examples

Critical Path Method (CPM)||Project Management Technique||Operations Research||

Critical Path Method (CPM)||Project Management Technique||Operations Research||

Transshipment Model in Transportation Problem: Sources and Destinations acting as Transient Nodes||

Transshipment Model in Transportation Problem: Sources and Destinations acting as Transient Nodes||

Transportation Problem||MODI Method||u-v Method, where m+n-1=Allocated cell value||Example 1

Transportation Problem||MODI Method||u-v Method, where m+n-1=Allocated cell value||Example 1

Unbalanced Transportation Problem||VAM Method||Tie Case||Example 2

Unbalanced Transportation Problem||VAM Method||Tie Case||Example 2

Unbalanced Transportation Problem||VAM Method||Tie Case

Unbalanced Transportation Problem||VAM Method||Tie Case

Unbalanced Transportation Problem||Least Cost Cell Method||Tie Case

Unbalanced Transportation Problem||Least Cost Cell Method||Tie Case

Unbalanced Transportation Problem||Northwest Corner Cell Method||Least Cost Cell Method||VAM Method

Unbalanced Transportation Problem||Northwest Corner Cell Method||Least Cost Cell Method||VAM Method

Transportation Problem||Vogel's Approximation Method||Balanced Transportation Problem||Example 1

Transportation Problem||Vogel's Approximation Method||Balanced Transportation Problem||Example 1

Transportation Problem||Northwest Corner Method||Balanced Transportation Problem||Example 2

Transportation Problem||Northwest Corner Method||Balanced Transportation Problem||Example 2

Transportation Problem||Northwest Corner Method||Least Cost Method||Balanced Transportation Problem

Transportation Problem||Northwest Corner Method||Least Cost Method||Balanced Transportation Problem

Sequential Model | Job Sequencing | Sequencing Problem | N Jobs M Machines | Lecture 4

Sequential Model | Job Sequencing | Sequencing Problem | N Jobs M Machines | Lecture 4

Sequential Model | Job Sequencing | Sequencing Problem | N Jobs 3 Machines | Lecture 3

Sequential Model | Job Sequencing | Sequencing Problem | N Jobs 3 Machines | Lecture 3

Sequential Model | Job Sequencing | Sequencing Problem | N Jobs 2 Machines | Lecture 2

Sequential Model | Job Sequencing | Sequencing Problem | N Jobs 2 Machines | Lecture 2

Sequential Model | Job Sequencing | Sequencing Problem | N Jobs 2 Machines | Lecture 1

Sequential Model | Job Sequencing | Sequencing Problem | N Jobs 2 Machines | Lecture 1

Lecture 5: Hungarian Method to solve assignment problem || Restricted Assignment Problem

Lecture 5: Hungarian Method to solve assignment problem || Restricted Assignment Problem

Lecture 4: Hungarian Method to solve assignment problem || Unbalanced Assignment Problem

Lecture 4: Hungarian Method to solve assignment problem || Unbalanced Assignment Problem

Lecture 3: Hungarian Method to solve assignment problem || Optimal Solution || Maximization Case

Lecture 3: Hungarian Method to solve assignment problem || Optimal Solution || Maximization Case

Lecture 2: Hungarian Method to solve Assignment Problems || Optimal Solution || Minimization Problem

Lecture 2: Hungarian Method to solve Assignment Problems || Optimal Solution || Minimization Problem

Lecture 1: Hungarian Method to solve Assignment Problems||Optimal Solution||Minimization Problem

Lecture 1: Hungarian Method to solve Assignment Problems||Optimal Solution||Minimization Problem

Lecture 3: Graphical Method in LPP || Unique Solution || Maximization Problem || In Hindi

Lecture 3: Graphical Method in LPP || Unique Solution || Maximization Problem || In Hindi

Lecture 2: Graphical Method in LPP || Unique Solution || Minimization Problem || In Hindi

Lecture 2: Graphical Method in LPP || Unique Solution || Minimization Problem || In Hindi

Lecture 1: Graphical Method in LPP || Infeasible Solution || In Hindi

Lecture 1: Graphical Method in LPP || Infeasible Solution || In Hindi