TestUstad

All Free Mathematics MCQs with Answers

Every Mathematics question in the bank, across all chapters, each with the correct answer and a written explanation. Free and unlimited, with no account needed.

1,551 questions · page 78 of 78

1541. The nonnegative constraints are also known as

  • A. variables
  • B. constraints
  • C. solution
  • D. None

Explanation: Nonnegative constraints often refer to constraints on variables in optimization problems, requiring them to be nonnegative.

Read the full explanation →
Correct answer: variables

1542. The graph of a linear inequality with two variables represents,

  • A. Ellipse
  • B. Circle
  • C. Region
  • D. None

Explanation: The graph of a linear inequality with two variables represents a region in the coordinate plane.

Read the full explanation →
Correct answer: Region

1543. A feasible region is always

  • A. convex
  • B. bounded
  • C. unbounded
  • D. None

Explanation: A feasible region is typically defined as convex, meaning that any line segment connecting two points within the region lies entirely…

Read the full explanation →
Correct answer: convex

1544. Set of values of decision variable which satisfied the constraint of linear programming

  • A. Vertex
  • B. solution
  • C. boundary
  • D. none of these

Explanation: In linear programming, the set of values of decision variables that satisfy all the constraints is referred to as a solution.

Read the full explanation →
Correct answer: solution

1545. The number of ordered pairs that satisfy the inequality is

  • A. finite
  • B. infinite
  • C. unique
  • D. None

Explanation: In many cases, the number of ordered pairs that satisfy an inequality is infinite.

Read the full explanation →
Correct answer: infinite

1546. A point which is used to determine position of half plane is called

  • A. corner point
  • B. test point
  • C. boundary point
  • D. None

Explanation: In the context of linear inequalities and half planes, a test point is a point used to determine which side of the boundary line (or…

Read the full explanation →
Correct answer: test point

1547. Feasible region is region restricted to the quadrant.

  • A. I
  • B. II
  • C. III
  • D. IV

Explanation: The feasible region in the context of linear programming is the region of the coordinate plane that satisfies all the constraints of the…

Read the full explanation →
Correct answer: I

1548. The process used to maximize or minimize a quantity is called,

  • A. optimization
  • B. solution
  • C. both a & b
  • D. none of these

Explanation: The process of maximizing or minimizing a quantity, often subject to certain constraints, is known as optimization.

Read the full explanation →
Correct answer: optimization

1549. Convex region is not

  • A. bounded
  • B. unbounded
  • C. dashed line
  • D. closed

Explanation: A convex region is characterized by the property that the line segment connecting any two points within the region lies entirely within…

Read the full explanation →
Correct answer: dashed line

1550. The variables used in the system of linear inequalities are

  • A. negative
  • B. non negative
  • C. feasible region
  • D. None

Explanation: In the context of linear inequalities and optimization problems, the variables used typically represent quantities that cannot be…

Read the full explanation →
Correct answer: non negative

1551. The graph of the inequality x+2>0 is.

  • A. open right half plane
  • B. closed right half plane
  • C. open left half plane
  • D. closed left half

Explanation: The inequality \(x + 2 > 0\) represents all points \(x\) that are greater than 2.

Read the full explanation →
Correct answer: open right half plane
Start Free Mathematics Practice MCQs Test