Linear programming 2

Question 1

more appropriate method for solving complicated LP models (3 or more variables)

Answer 1

LP Simplex method

Question 2

iterative process

Answer 2

LP Simplex method

Question 3

what do you add For a less than or equal to constraint

Answer 3

slack

Question 4

what do you add For a strict equality constraint

Answer 4

artificial variable

Question 5

For a greater than or equal to constraint

Answer 5

-s +a

Question 6

For objective function maximization

Answer 6

subtract the most expensive artificial variable

Question 7

For objective function minimization

Answer 7

add the most expensive artificial variable

Question 8

A computational device used in linear programming to achieve
an initial solution to the problem.

Answer 8

Artificial variable

Question 9

The process of adding slack and/or artificial variables to
constraints to generate equations.

Answer 9

Augmentation

Question 10

A column in the simplex tableau which contains the profit or cost per
unit for the variable in the solution.

Answer 10

Cj column

Question 11

The row containing the net benefit or loss occasioned by bringing one
unit of a variable into the solution of a linear programming problem

Answer 11

Cj-Zj row

Question 12

Elements which are common to both the optimum
column and the rows representing variables in the solution.

Answer 12

intersectional elements

Question 13

A step-by-step process following a standard pattern.

Answer 13

iterative process

Question 14

That column in any solution to a maximizing problem
which has the largest positive value in the Cj-Zj row or which has the largest
negative value in a minimizing problem

Answer 14

Optimum column

Question 15

The process of going from one simplex tableau to the next.

Answer 15

pivoting

Question 16

The column containing all the variables in a solution in
the simplex tableau.

Answer 16

product-mix column

Question 17

The column in a simplex tableau indicating the quantities
of the variables that are in a solution.

Answer 17

quantity column

Question 18

The entries of the Cj-Zj row.

Answer 18

reduced costs

Question 19

A row in the simplex tableau which is replaced by the variable entering
the new solution.

Answer 19

Replaced row

Question 20

A row in the simplex tableau which is replaced by the variable entering
the new solution.

Answer 20

Replaced row

Question 21

An efficient method for solving a linear programming problem

Answer 21

simplex method

Question 22

A variable used in linear programming to convert an inequality into an
equation.

Answer 22

slack variable

Question 23

A variable present in a linear programming problem before
augmentation

Answer 23

structural variable

Question 24

A slack variable in a greater –than-or-equal-to constraint

Answer 24

Surplus variable

Question 25

The column of entries under a heading variable in the simplex
tableau

Answer 25

Variable column

Question 26

Cj-Zj are zero or negative

Answer 26

maximization

Question 27

Cj-Zj are zero or positive

Answer 27

minimization