The modern applications for linear programming include _____
What is airline crew scheduling, shipping or telecommunication networks, oil refining and blending, and stock and bond portfolio selection?
100
The first step in solving a word problem in linear programming is ___
What is "translate words into constraints and objective function"?
100
Term for the following:
x>0
y>0
2x+3y<100
5x+7y<50
What is "constraints"?
100
Given a linear programming set of constraints and objective function, the first step in the Simplex Method is ____
What is "add a unique slack variable to each inequality, changing each to an equation"?
200
1940's relevance to graph theory is...
What is the decade in which linear programming was mainly first developed?
200
The field that most benefits from linear programming...
What is economics / business?
200
If you have a list of constraints, the next step in the graphic method of linear programming is _____
What is "graph the constraints, shading appropriately"?
200
Definition of a constraint is ___
What is "an inequality in a linear programming problem"?
200
After adding slack variables to the constraints the next step in the simplex method is to __________ ( re: the objective function)
What is "set the objective function equal to zero, by subtracting the variable terms from both sides of the equation"?
300
Linear programming was initially created to...
What is figuring out solutions to planning problems (allocation of resources) in WWII?
300
Linear programming methods can be used to ____ profits.
What is maximize?
300
Once you've graphed and shaded the linear constraints, the next step is to _____
What is "find the corner points of the feasible region"?
300
Definition of feasible region is ____
What is "the region in which all the constraints are satisfied or the shaded region on the graph of constraints"?
300
The simplex table is created by doing the following to the set of equations (which have been derived from the original constraints and objective function) _____
What is "create an augmented matrix, with the coefficients of the constraints in the top left section, the constants to the right of the augmentation line, and the coefficients of the objective function in the bottom row"?
400
Man who discovered the simplex method, published in 1947...
Who is Dantzig?
400
Linear programming methods can be used to ____ costs.
What is minimize?
400
When you've got the corner points of the feasible region, the next step is to ______
What is "put the corner points into the objective function"?
400
Definition of non-negativity constraints is ____
What are "x>=0 and y>=0"?
400
Once you have a Simplex Table, in order to solve it, the first step is to _____
What is "find the pivot (or, alternatively, find the most negative value in the bottom row, thereby finding the pivot column)"?
500
The nobel prize was awarded to Leonid Kantorovich and Tjalling Koopmans for what...
What is their contributions to the optimal allocation of resources?
500
Ture or False: Computers can be used to efficiently solve linear programming problems.
What is "True"?
500
The last step to solve linear programming problem is to _____
What is "state the solution fully, with as much detail as possible"?
500
Definition of objective function is ___
What is "a function or equation to find the value to be optimized in a linear programming problem, often maximizing Profit or minimizing Cost"?
500
You are done pivoting when ____
What is "there are no negative numbers in the bottom row"?