Question 20 of 36
Q.(a) Prove that .
(OR)
(b) Solve the following linear programming problem by graphical method :
Minimize subject to the constraints , , and .
Tamil Nadu DgeTamil Nadu HSC First Year (DGE) Commerce Board 2020Subjective· 5mImportance★★★★★
56% · 20/36 Questions
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →- Reduce each trig ratio to a standard angle and add: result . (b) Graph the three constraints; the corner points give minimum at . A 5-mark either/or from the Trigonometry / Operations Research units of the Tamil Nadu HSC Class-11 Business Mathematics syllabus. Both alternatives are solved. (a) Prove . Step 1 — Reduce each angle. Step 2 — Substitute. Step 3 — Add. Hence proved.
- LPP by graphical method. Minimize subject to Step 1 — Simplify the constraints. Step 2 — Boundary lines and intercepts. meets axes at ; at ; at . The feasible region (all ) is unbounded, lying above every line in the first quadrant. …
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.