Linear Programming Class 12 Mcq Test (121201)

How many non-trivial constraints are typically considered in an optimization problem?

A) One

B) Two

C) Three

D) Four

What is the term used to describe a solution that is not restricted by any boundaries or constraints?

A) Feasible solution

B) Infeasible solution

C) Optimal solution

D) Unbounded solution

If a feasible region has a boundary, it is considered:

A) Bounded

B) Unbounded

C) Infeasible

D) Optimal

Which term refers to a solution that does not satisfy all the constraints in an optimization problem?

A) Feasible solution

B) Infeasible solution

C) Optimal solution

D) Unbounded solution

What is the term used to describe the limitations or restrictions on the variables in an optimization problem?

A) Constraints

B) Feasible region

C) Objective function

D) Infeasible solution

Which term refers to the collection of all possible solutions that satisfy the constraints in an optimization problem?

A) Constraints

B) Objective function

C) Feasible region

D) Infeasible solution

What do we call a solution that satisfies all the constraints in an optimization problem?

A) Feasible solution

B) Infeasible solution

C) Optimal solution

D) Unbounded solution

Which of the following terms refers to the mathematical representation of the goal to be achieved in an optimization problem?

A) Constraints

B) Objective function

C) Feasible region

D) Infeasible solution

In an optimization problem, the graphical method is used to find solutions in how many variables?

A) One

B) Two

C) Three

D) Four

In the graphical method, what do we call the intersection of the feasible region and the objective function?

A) Optimal solution

B) Infeasible solution

C) Feasible solution

D) Critical point