Chapter 12: Linear Programming
NCERT Solutions for CBSE Class 10 Mathematics — 4 solved questions with detailed explanations.
Solved Questions
Q1. In linear programming, the objective function is:
- Always quadratic
- Always linear
- Any polynomial
- Exponential
Difficulty: Easy · Topic: LP Basics
Solution
Linear programming optimizes a linear objective function subject to linear constraints.
Q2. The feasible region of a linear programming problem is always:
- Convex
- Concave
- Circular
- Unbounded
Difficulty: Easy-Medium · Topic: Feasible Region
Solution
The feasible region (intersection of half-planes) is always a convex set.
Q3. Optimal solution of LPP lies at:
- center of feasible region
- outside feasible region
- any interior point
- corner point of feasible region
Difficulty: Easy-Medium · Topic: Linear Programming
Solution
corner point of feasible region.
Q4. If feasible region is unbounded, optimal value:
- may or may not exist
- never exists
- is always at origin
- always exists
Difficulty: Easy-Medium · Topic: Linear Programming
Solution
may or may not exist.
Other Chapters in Mathematics
Want to practice these questions interactively?
Get instant feedback, track progress, and improve with adaptive practice.
Start Practicing Free →
