Day 68: CBSE Class 12 Maths
5 questions. Try each one first, then open its answer.
Question 1
Inverse Trigonometric Functions. Asked once: 2025 (same type asked 4 times)
2Domain of is :Tap an option to check your answer.
Question 2
Linear Programming. Asked once: 2026 (same type asked 4 times)
31Solve the following linear programming problem graphically : Maximize Subject to constraints ,Question 3
Linear Programming. Asked once: 2025 (same type asked 4 times)
24For a Linear Programming Problem, find min (where Z is the objective function) for the feasible region shaded in the given figure. (Note : The figure is not to scale)Question 4
Linear Programming. Asked once: 2025 (same type asked 4 times)
31For the given graph of a Linear Programming Problem, write all the constraints satisfying the given feasible region.Question 5
Linear Programming. Asked once: 2026 (same type asked 4 times)
15In the graph, the feasible region representing the Linear Programming Problem for maximising objective function , is shaded. If all points on segment AB give max (Z), then which of the following is true ?Tap an option to check your answer.