chapter 6

3. problem: A problem where a quantity must be maximized or minimized following a set of guidelines or conditions.
5. programming: A mathematical technique used to determine which solutions in the feasible region result in .the optimal solutions of the objective function.
7. region: The solution region for a system of linear inequalities that is modeling an optimization problem.
8. plane: The region on one side of the graph of a linear relation on a Cartesian plane.
9. A limiting condition of the optimization problem being modelled, represented by a linear inequality.
10. A connected set of numbers. In a continuous set, there is always another number between any two given numbers. Continuous variables represent things that can be measured, such as time.
11. function: In an optimization problem, the equation that represents the relationship between the two variables in the system of linear inequalities and the quantity to be optimized.

1. of linear inequalities: A set of two or more linear inequalities that are graphed on the same coordinate plane the intersection of their solution regions represents the solution set for the system.
2. of separate or distinct parts. Discrete variables represent things that can be counted, such as people in a room.
4. solution: A point in the solution set that represents the maximum or minimum value of the objective function.
6. set: The set of all possible solutions.