Linear Programming — Quiz It!

What is Linear Programming?

• An optimization technique used when assigning (e.g. workers to tasks)

• An optimization technique used in identifying the optimal route to be taken.

• An optimization technique which comprises of linear constraints and a linear objective function.

• None of the Above

Linear programming (LP) is applied and seen in which of the following fields:

• Electrical Systems

• Dietary Plans

• Aerodynamic Shape Optimization

• Production of School Supplies

• All of the Above

Which of the following is NOT considered as a component of a Linear Programming Model / Problem?

• Feasible Region

• Constraints

• Decision Variables

• Objective Function

Tags

CCSS.HSA.REI.D.12

What is a decision variable?

• The decision variables are the variables subjected to maximization or minimization.

• Decision variables are variables that serve as quantities to be determined.

• Decision variables are variables that are seen as the corner points within a graph.

• Decision variables are restrictions involved in the maximizing or minimizing of the objective function.

Tags

CCSS.8.EE.C.8B

What is a constraint?

• A constraint is a region in multidimensional space whose boundaries are formed by hyperplanes and whose corners are vertices.

• A constraints is a restriction involved in the maximizing or minimizing of the objective function.

• A constraint is a function of subjected to maximization or minimization.

• A constraint is a group of variables to be determined.

Tags

CCSS.8.EE.C.8B

What is an objective function?

• An objective function is the solution to the system of linear inequalities that had been constructed.

• An objective function is a restriction used in maximizing or minimizing.

• An objective function are variables or quantities to be determined.

• An objective function is the variable subjected to maximization or minimization.

All of the statements below defines what a feasible region is EXCEPT:

• The feasible region is the solution to the system of linear inequalities that had been constructed.

• The feasible region is the variable subjected to maximization or minimization.

• In a feasible region, the set of all points that satisfy all the constraints would be found.

• It is through the feasible region that the optimal solution can be found via maximizing or minimizing the objective function.

Tags

CCSS.HSA.REI.D.12

What are corner points?

• The corner points of a linear programming model are the vertices of the feasible region.

• Corner points are the unknowns within a linear programming model.

• Corner points are variables said to be unbounded from above if the simple upper is not specified for a variable.

• The corner points come in the form of a convex polytope (in 2 dimensions, a convex polygon; in 3 dimensions, a convex polyhedron; and so on).

Which among the following statements about bounded regions is correct:

• A bounded region contains all the necessary components which comprise a linear programming model.

• A bounded region is a feasible region that can be enclosed within a circle.

• A bounded region cannot be enclosed within a circle.

• A bounded region is a collection of coefficients for all values of the indices i and j.

There is a need for all parameter values to be known for one to completely determine the model.

• True

• False