ParhaiKrlo

NUST NET Mathematics — Linear Inequalities and Linear Programming

Linear Inequalities and Linear Programming is part of the FSc Mathematics course that NUST NET-Engineering draws on (Mathematics is 100 of the 200 MCQs). It breaks into 1 subtopic, and we hold 42 NET-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 8 NET-pattern papers on ParhaiKrlo, Linear Inequalities and Linear Programming accounts for 18 questions. It appears in all 8, about 2.3 questions a paper. The heaviest was NUST NET Past Paper 06, with 3 questions, and the most recent is NUST NET Past Paper 07, with 2.

Linear Inequalities and Linear Programming questions per paper
PaperQuestions
NUST NET Past Paper 072
NUST NET Past Paper 082
NUST NET Past Paper 052
NUST NET Past Paper 063
NUST NET Past Paper 033
NUST NET Past Paper 042
NUST NET Past Paper 012
NUST NET Past Paper 022

Linear Inequalities and Linear Programming MCQs from the NET-pattern papers

Try each one before opening the answer. Each comes with a short explanation.

  1. Q1 · NUST NET Past Paper 07 · Linear Inequalities and Linear Programming

    In linear programming, the set of all points that satisfy every constraint is called the:

    • A.objective function
    • B.feasible region
    • C.optimal solution
    • D.decision variable
    Show answer

    Answer: B. feasible region — The points satisfying all the constraints form the feasible region.

  2. Q2 · NUST NET Past Paper 08 · Linear Inequalities and Linear Programming

    In a linear programming problem, the function that is to be maximised or minimised is called the:

    • A.constraint
    • B.feasible region
    • C.objective function
    • D.corner point
    Show answer

    Answer: C. objective function — The function to optimise is the objective function.

  3. Q3 · NUST NET Past Paper 05 · Linear Inequalities and Linear Programming

    The graph of the inequality x ≥ 0 in the xy-plane is the region:

    • A.below the x-axis
    • B.to the left of the y-axis
    • C.above the line y = x
    • D.on and to the right of the y-axis
    Show answer

    Answer: D. on and to the right of the y-axis — x ≥ 0 is the y-axis together with the half-plane to its right.

Practise this topic

Practise Linear Inequalities and Linear Programming — 42 MCQs ›Sit a full NET paper ›

Other Mathematics topics

‹ Full NET Mathematics syllabus · All NET subjects · NUST NET past papers