Maths Complete Marathon MHTCET 2026 - MHT-CET Maths

Mathematics: Key Concepts, Formulas, and Problem-Solving Strategies

Exam Structure, Weightage, and Approach The mathematics exam covers a range of chapters, each with a specific weightage and expected number of questions. Strategic preparation is essential, focusing on high-weightage chapters and practicing problem types that frequently appear. Efficient time management...

What is standard deviation of the set of observations $32,28,29,30,31$?

<math xmlns="http://www.w3.org/1998/Math/MathML"><msqrt><mn>2</mn></msqrt></math>

If the angle between the lines is $45\&deg;$and the slope of one of its lines is $\frac{1}{2}$, then the slope of the other line can be

<math xmlns="http://www.w3.org/1998/Math/MathML"><mn>3</mn><mo>,</mo><mo> </mo><mfrac><mrow><mo>-</mo><mn>1</mn></mrow><mn>3</mn></mfrac></math>

What is standard deviation of the set of observations $32,28,29,30,31$?

<math xmlns="http://www.w3.org/1998/Math/MathML"><msqrt><mn>2</mn></msqrt></math>

If the angle between the lines is $45\&deg;$and the slope of one of its lines is $\frac{1}{2}$, then the slope of the other line can be

<math xmlns="http://www.w3.org/1998/Math/MathML"><mn>3</mn><mo>,</mo><mo> </mo><mfrac><mrow><mo>-</mo><mn>1</mn></mrow><mn>3</mn></mfrac></math>

What is the objective function in the given Linear Programming Problem and what does it represent?

The objective function is $Z = 3x + 5y$. In a Linear Programming Problem, this function is what needs to be optimized (either minimized or maximized) by finding the appropriate values of $x$ and $y$ within the feasible region defined by the constraints.

Explain the corner point method for finding the minimum value of an objective function in a Linear Programming Problem.

The corner point method involves identifying all vertices (corner points) of the feasible region defined by the constraints. The objective function is then evaluated at each of these corner points. The smallest value obtained among these evaluations represents the minimum value of the objective function within the feasible region.