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

In an optimization problem, what do we call the solution that not only satisfies all the constraints but also produces the best possible outcome?

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 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

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

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

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 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

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

A) One

B) Two

C) Three

D) Four

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

A) One

B) Two

C) Three

D) Four