Simplex method ||Linear programming problem||LPP||Concept to solve lpp by simplex method||Ritesh sir
25:03
Lec-27|A connected graph G has an euler trail iff it has at most 2 vertices of odd degree|Riteshsir
52:43
Simplex method||Linear programming problem||part-2 ||Example of LPP solving by simplex ||Ritesh sir
34:26
Assignment problem || नियतन समस्या ||paper-3 ||Semester-1 || by Ritesh sir
34:24
Paper-3 ||Semester-1|| Assignment problem with modified matrix ||how do assign zeroes||Ritesh sir
24:05
BIHAR BOARD CLASS -10TH KA MATH EX -1A BAHUPAD QUESTION NO 6(2,3). BY:-SUJIT SIR
17:22
Lec-26|G is simple graph with k connected components.Then no.of edges can’t exceed (n-k)(n-k+1)/2
14:54
Real analysis|semester-3|monotonic sequence|b.sc 2nd year|maths classes|Csir net|iitjam| Ritesh sir
26:56