provide correct answer for below:  

What is the primary objective of linear programming?

Question 1 options:

Minimize or maximize a linear objective function

Solve quadratic equations

 Perform a statistical analysis

Create nonlinear models

Question 2 (1 point)   Which of the following is not a component of a linear programming model?

Question 2 options:

Decision variables

Nonlinear variables

Objective Function 

Constraints

Question 3 (1 point)   In a linear programming problem, the feasible region is:

Question 3 options:

The solution to a nonlinear equation

The region outside the constraints

The set of points where the objective function is zero

The area where all constraints are satisfied

Question 4 (1 point)   What does the corner-point method in linear programming rely on?

Question 4 options:

Checking all points within the feasible region

Using random sampling 

Solving differential equations

Evaluating the objective function at each corner of the feasible region

Question 5 (1 point)   Which of the following is a necessary assumption in linear programming?

Question 5 options:

Decision variables must be integer values

There are no constraints

The relationship between decision variables is linear

The relationships between variables are nonlinear

Question 6 (1 point)   The term "slack variable" in linear programming refers to:

Question 6 options:

Variables added to convert inequalities into equalities

Variables representing negative constraints

Decision variables that are unused

Variables subtracted to solve the dual problem

Question 7 (1 point)   What type of solutions can a linear programming problem have?

Question 7 options:

No solution

Infinite solutions

Unique solution

All of the above

Question 8 (1 point)   What is the graphical method of solving a linear programming problem limited to?

Question 8 options:

Problems with three decision variables

Problems with two decision variables

Problems with constraints only

Problems without an objective function

Question 9 (1 point)   Which of the following methods is typically used to solve large-scale linear programming problems?

Question 9 options:

Quadratic optimization

Monte Carlo simulation

Simplex method

Question 10 (1 point)   In linear programming, an unbounded solution occurs when:

Question 10 options:

There are no feasible solutions

The constraints are too restrictive

The feasible region is not enclosed and the objective function increases indefinitely