14
Corner point principle
The principle that states that there is a corner point of the feasible region that yields the optimal solution.
Feasible point
A possible solution (but not necessarily the best) to a linear programming problem. With just two products, we can think of a feasible point as a point on the plane.
Feasible region
The set of all feasible points, that is, possible solutions to a linear programming problem; For problems with just two products, the feasible region is a part of the plane.
Feasible set
Another term for feasible region.
Linear programming
A set of organized methods of management science used to solve problems of finding optimal solutions, while at the same time respecting certain important constraints; The mathematical formulations of the constraints in linear programming problems are linear equations and inequalities; Mixture problems are usually solved by some type of linear programming.
Minimum constraint
An inequality in a mixture problem that gives a minimum quantity of a product; Negative quantities can never be produced.
Mixture chart
A table displaying the relevant data in a linear programming mixture problem; The table has a row for each product and a column for each resource, for any nonzero minimums, and for the profit.
Mixture problem
A problem in which a variety of resources available in limited quantities can be combined in different ways to make different products; It is usually desired to find the way of combining the resources that produces the most profit.
Optimal production policy
A corner point of the feasible region where the profit formula has a maximum value.
Production policy
A point in the feasible set, interpreted as specifying how many units of each product are to be made.
Profit formula
The expression, involving the unknown quantities such as x and y, that tells how much profit results from a particular production policy.
Profit line
In a two-dimensional, two-product, linear programming problem, the set of all feasible points that yield the same profit.
Resource constraint
An inequality in a mixture problem that reflects the fact that no more of a resource can be used than what is available.
Simplex method
One of a number of algorithms for solving linear programming problems.