FAST-NU Advanced Mathematics — Linear Inequalities and Linear Programming
Linear Inequalities and Linear Programming is part of the Advanced Mathematics section of FAST's BS CS/Engineering admission test (usually 50 of the 120 MCQs, 50% of the marks). It breaks into 1 subtopic, and we hold 21 FAST-pattern practice MCQs on it, each with a written explanation. Tap a subtopic below to practise just that.
Subtopics (1)
How Linear Inequalities and Linear Programming is tested
Across the 7 FAST-pattern papers on ParhaiKrlo, Linear Inequalities and Linear Programming accounts for 7 questions. It appears in all 7, about 1 questions a paper. The heaviest was FAST Past Paper 07, with 1 question.
| Paper | Questions |
|---|---|
| FAST Past Paper 07 | 1 |
| FAST Past Paper 06 | 1 |
| FAST Past Paper 05 | 1 |
| FAST Past Paper 04 | 1 |
| FAST Past Paper 03 | 1 |
| FAST Past Paper 02 | 1 |
| FAST Past Paper 01 | 1 |
Linear Inequalities and Linear Programming MCQs from the FAST-pattern papers
Try each one before opening the answer. Each comes with a short explanation.
- Q1 · FAST Past Paper 07 · Linear Inequalities and Linear Programming
In a linear programming problem with a bounded feasible region, the maximum or minimum value of the objective function occurs:
- A.at the origin in every case
- B.at any interior point
- C.at the centre of the region
- D.at a corner point of the feasible region
Show answer
Answer: D. at a corner point of the feasible region — The optimum of a linear objective over a bounded feasible region is reached at a corner (vertex).
- Q2 · FAST Past Paper 06 · Linear Inequalities and Linear Programming
In linear programming, a point that satisfies all the constraints of the problem is called:
- A.an objective function
- B.a constraint
- C.a feasible solution
- D.a slack value
Show answer
Answer: C. a feasible solution — Any point satisfying every constraint is a feasible solution; together they form the feasible region.
- Q3 · FAST Past Paper 05 · Linear Inequalities and Linear Programming
Which of the following points does NOT satisfy the inequality 3x + 2y ≤ 12?
- A.(2, 3)
- B.(0, 6)
- C.(1, 1)
- D.(4, 1)
Show answer
Answer: D. (4, 1) — At (4, 1), 3(4) + 2(1) = 14 > 12.