#### Topics

##### Mathematical Logic

- Statements - Introduction in Logic
- Sentences and Statement in Logic
- Truth Value of Statement in Logic
- Open Sentences in Logic
- Compound Statement in Logic
- Quantifier and Quantified Statements in Logic
- Logical Connectives
- Truth Tables of Compound Statements
- Examples Related to Real Life and Mathematics
- Statement Patterns and Logical Equivalence
- Algebra of Statements
- Difference Between Converse, Contrapositive, Contradiction
- Application of Logic to Switching Circuits, Switching Table.

##### Mathematical Logic

- Truth Value of Statement in Logic
- Logical Connective, Simple and Compound Statements
- Truth Tables of Compound Statements
- Statement Patterns and Logical Equivalence
- Tautology, Contradiction, and Contingency
- Quantifier and Quantified Statements in Logic
- Duality
- Negations of Compound Statements
- Converse, Inverse, and Contrapositive
- Algebra of Statements
- Application of Logic to Switching Circuits, Switching Table.

##### Matrics

##### Trigonometric Functions

##### Pair of Straight Lines

##### Vectors

- Representation of Vector
- Vectors and Their Types
- Algebra of Vectors
- Coplanar Vectors
- Vector in Two Dimensions (2-D)
- Three Dimensional (3-D) Coordinate System
- Components of Vector
- Position Vector of a Point P(X, Y, Z) in Space
- Component Form of a Position Vector
- Vector Joining Two Points
- Section formula
- Dot/Scalar Product of Vectors
- Cross/Vector Product of Vectors
- Scalar Triple Product of Vectors
- Vector Triple Product
- Addition of Vectors

##### Line and Plane

##### Linear Programming

##### Matrices

- Elementary Operation (Transformation) of a Matrix
- Inverse by Elementary Transformation
- Elementary Transformation of a Matrix Revision of Cofactor and Minor
- Inverse of a Matrix Existance
- Adjoint Method
- Addition of Matrices
- Solving System of Linear Equations in Two Or Three Variables Using Reduction of a Matrix Or Reduction Method
- Solution of System of Linear Equations by – Inversion Method

##### Differentiation

##### Applications of Derivatives

##### Indefinite Integration

##### Definite Integration

##### Application of Definite Integration

##### Differential Equations

##### Probability Distributions

##### Binomial Distribution

##### Trigonometric Functions

- Trigonometric equations
- General Solution of Trigonometric Equation of the Type
- Solution of a Triangle
- Hero’s Formula in Trigonometric Functions
- Napier Analogues in Trigonometric Functions
- Basic Concepts of Trigonometric Functions
- Inverse Trigonometric Functions - Principal Value Branch
- Graphs of Inverse Trigonometric Functions
- Properties of Inverse Trigonometric Functions

##### Pair of Straight Lines

- Pair of Lines Passing Through Origin - Combined Equation
- Pair of Lines Passing Through Origin - Homogenous Equation
- Theorem - the Joint Equation of a Pair of Lines Passing Through Origin and Its Converse
- Acute Angle Between the Lines
- Condition for Parallel Lines
- Condition for Perpendicular Lines
- Pair of Lines Not Passing Through Origin-combined Equation of Any Two Lines
- Point of Intersection of Two Lines

##### Circle

- Tangent of a Circle - Equation of a Tangent at a Point to Standard Circle
- Tangent of a Circle - Equation of a Tangent at a Point to General Circle
- Condition of tangency
- Tangents to a Circle from a Point Outside the Circle
- Director circle
- Length of Tangent Segments to Circle
- Normal to a Circle - Equation of Normal at a Point

##### Conics

##### Vectors

- Vectors Revision
- Collinearity and Coplanarity of Vectors
- Linear Combination of Vectors
- Condition of collinearity of two vectors
- Conditions of Coplanarity of Three Vectors
- Section formula
- Midpoint Formula for Vector
- Centroid Formula for Vector
- Basic Concepts of Vector Algebra
- Scalar Triple Product of Vectors
- Geometrical Interpretation of Scalar Triple Product
- Application of Vectors to Geometry
- Medians of a Triangle Are Concurrent
- Altitudes of a Triangle Are Concurrent
- Angle Bisectors of a Triangle Are Concurrent
- Diagonals of a Parallelogram Bisect Each Other and Converse
- Median of Trapezium is Parallel to the Parallel Sides and Its Length is Half the Sum of Parallel Sides
- Angle Subtended on a Semicircle is Right Angle

##### Three Dimensional Geometry

##### Line

##### Plane

- Equation of Plane in Normal Form
- Equation of Plane Passing Through the Given Point and Perpendicular to Given Vector
- Equation of Plane Passing Through the Given Point and Parallel to Two Given Vectors
- Equation of a Plane Passing Through Three Non Collinear Points
- Equation of Plane Passing Through the Intersection of Two Given Planes
- Vector and Cartesian Equation of a Plane
- Angle Between Two Planes
- Angle Between Line and a Plane
- Coplanarity of Two Lines
- Distance of a Point from a Plane

##### Linear Programming Problems

##### Continuity

- Introduction of Continuity
- Continuity of a Function at a Point
- Defination of Continuity of a Function at a Point
- Discontinuity of a Function
- Types of Discontinuity
- Concept of Continuity
- Algebra of Continuous Functions
- Continuity in Interval - Definition
- Exponential and Logarithmic Functions
- Continuity of Some Standard Functions - Polynomial Function
- Continuity of Some Standard Functions - Rational Function
- Continuity of Some Standard Functions - Trigonometric Function
- Continuity - Problems

##### Differentiation

- Revision of Derivative
- Relationship Between Continuity and Differentiability
- Every Differentiable Function is Continuous but Converse is Not True
- Derivatives of Composite Functions - Chain Rule
- Derivative of Inverse Function
- Derivatives of Inverse Trigonometric Functions
- Derivatives of Implicit Functions
- Exponential and Logarithmic Functions
- Derivatives of Functions in Parametric Forms
- Derivative of Functions in Product of Function Form
- Derivative of Functions in Quotient of Functions Form
- Higher Order Derivative
- Second Order Derivative

##### Applications of Derivative

##### Integration

- Methods of Integration - Integration by Substitution
- Methods of Integration - Integration Using Partial Fractions
- Methods of Integration - Integration by Parts
- Definite Integral as the Limit of a Sum
- Fundamental Theorem of Calculus
- Properties of Definite Integrals
- Evaluation of Definite Integrals by Substitution
- Integration by Non-repeated Quadratic Factors

##### Applications of Definite Integral

##### Differential Equation

- Basic Concepts of Differential Equation
- Order and Degree of a Differential Equation
- General and Particular Solutions of a Differential Equation
- Formation of Differential Equation by Eliminating Arbitary Constant
- Differential Equations with Variables Separable Method
- Homogeneous Differential Equations
- Linear Differential Equation
- Applications of Differential Equation

##### Statistics

##### Probability Distribution

- Conditional Probability
- Random Variables and Its Probability Distributions
- Discrete and Continuous Random Variable
- Probability Mass Function (P.M.F.)
- Probability Distribution of a Discrete Random Variable
- Cumulative Probability Distribution of a Discrete Random Variable
- Expected Value, Variance and Standard Deviation of a Discrete Random Variable
- Probability Density Function (P.D.F.)
- Distribution Function of a Continuous Random Variable

##### Bernoulli Trials and Binomial Distribution

#### notes

Let us graph the constraints stated as linear inequalities:

5x + y ≤ 100 ... (1)

x + y ≤ 60 ... (2)

x ≥ 0 ... (3)

y ≥ 0 ... (4)

The graph of this system (shaded region) consists of the points common to all half planes determined by the inequalities (1) to (4) in following fig.

Each point in this region represents a feasible choice open to the dealer for investing in tables and chairs. The region, therefore, is called the feasible region for the problem. Every point of this region is called a feasible solution to the problem. The region other than feasible region is called an infeasible region.

The point (10, 50) (0, 60), (20, 0) is a feasible solution of the problem. Any point outside the feasible region is called an infeasible solution. For example, the point (25, 40) is an infeasible solution of the problem.

**Optimal (feasible) solution:**

Any point in the feasible region that gives the optimal value (maximum or minimum) of the objective function is called an optimal solution. Every point in the feasible region satisfies all the constraints and since there are infinitely many points, we can find the optimal solution using fundamental theorms in Linear programming problems.

#### theorem

Let R be the feasible region (convex polygon) for a linear programming problem and let Z = ax + by be the objective function. When Z has an optimal value (maximum or minimum), where the variables x and y are subject to constraints described by linear inequalities, this optimal value must occur at a corner point* (vertex) of the feasible region.

#### theorem

Let R be the feasible region for a linear programming problem, and let Z = ax + by be the objective function. If R is bounded, then the objective function Z has both a maximum and a minimum value on R and each of these occurs at a corner point (vertex) of R.

If R is unbounded , then a maximum or a minimum value of the objective function may not exist.

Corner points of the bounded (feasible) region :

O(0,0) A(20,0) B(10,50) C(0,60)

Computing the values of Z = 250x + 75 y at these points -

Vertex of the feasible region | Corresponding value of Z = 250 x +75 y (in Rs.) |

O(0,0) | 250(0) + 75(0) = 0 |

A(20,0) | 250(20)+75(0) = 5000 |

B(10,50) | 250(10)+75(50) = 6250 ← maximum |

C(0,60) | 250(0)+75(60)=4500 |

We observe that the maximum profit to the dealer results from the investment strategy (10, 50), i.e. buying 10 tables and 50 chairs.

This method of solving linear programming problem is referred as **Corner Point Method**.

The method comprises of the following steps :

1. Find the feasible region of the linear programming problem and determine its corner points (vertices) either by inspection or by solving the two equations of the lines intersecting at that point.

2. Evaluate the objective function Z = ax + by at each corner point. Let M and m, respectively denote the largest and smallest values of these points.

3. (i) When the feasible region is bounded, M and m are the maximum and minimum values of Z.

(ii) In case, the feasible region is unbounded, we have:

4. (a) M is the maximum value of Z, if the open half plane determined by ax + by > M has no point in common with the feasible region. Otherwise, Z has no maximum value.

(b) Similarly, m is the minimum value of Z,if the open half plane determined by ax + by < m has no point in common with the feasible region. Otherwise, Z has no minimum value.

Video link : https://youtu.be/csUT9faNTvA

#### Shaalaa.com | Linear Programming part 2 (Graphical Method Thoerem 1)

##### Series: series 1

00:12:56 undefined

00:12:05 undefined

00:13:42 undefined

00:14:25 undefined

00:04:48 undefined

00:04:29 undefined