Ch12. Linear Programming Problems

In this self study course, you will learn introduction, related terminology such as constraints, objective function, optimization, different types of linear programming (L.P.) problems, mathematical formulation of L.P. problems, graphical method of solution for problems in two variables, feasible and infeasible regions (bounded or unbounded), feasible and infeasible solutions, optimal feasible solutions (up to three non-trivial constraints).
For further understanding of concepts and for examination preparation, this course has explanation of all NCERT Exercise questions (except Exercise 12.1). Also, there is practice assignment that has questions from Board’s Question Bank, RD Sharma, NCERT Exemplar etc. instead of only one book. The PDF of assignment can be downloaded within the course.

Not Enrolled Enrollment status

6 hours 23 minutes Course Duration

English Syllabus medium

Hindi + English Explanation

The course duration is an approximation of the total length (duration) of all videos in the course, calculated automatically. Please report any errors to MathYug Support for prompt correction.

Course Content

Introduction

Different types of LPP

NCERT Exercise 12.2

Question – 2

Question – 1

NCERT Example

Example – 4

NCERT Exercise 2.2

Question – 3

Question – 4

Question – 5

Question – 6

Question – 7

Question – 8

Question – 9

Question – 10

Question – 11

NCERT Miscellaneous Exercise

Question – 1, 2

Question – 3

Question – 4

Question – 5

Question – 6

Question – 7

Question – 8, 9

Question – 10

Assignments

Course Content

Introduction

Different types of LPP

Question – 2

Question – 1

Example – 4

Question – 3

Question – 4

Question – 5

Question – 6

Question – 7

Question – 8

Question – 9

Question – 10

Question – 11

Question – 1, 2

Question – 3

Question – 4

Question – 5

Question – 6

Question – 7

Question – 8, 9

Question – 10

PDF of Assignments