Linear Optimization Mock Exam

In the canonical form of LPP if the objective function is of maximization, then allthe constraints other than non-negativity conditions are .

In the canonical form of LPP if the objective function is of minimization then all the constraints other than non-negativity conditions are .

.In the standard form of LPP if the objective functions is of minimization then all the constraints .

.The non-negative variable which is added to LHS of the constraint to convert the inequality ¡ into equation is called .

The non-negative variable which is added to LHS of the constraint to convert the inequality ¿ into equation is called .

Every LPP is associated with another LPP is called

is another method to solve a given LPP involving some artificial variable?

Suppose the following2x2game be given,then What will be the value of game?

Consider the following linear programming problem:performe it untill we getc j −z j ≤0 MaximizeZ= 3x 1 + 5x 2 + 4x 3 Subject to: 2x 1 + 3x 2 ≤8, 2x 1 + 3x 3 ≤10 3x 1 + 2x 2 + 4x 3 ≤15 x, y≥0 then,What is a basic solution in this problem?

Consider the following linear programming problem:performe it untill we getc j −z j ≥0 MinimizeZ=−3x 1 −9x 2 Subject to: 2x 1 +x 2 ≤40, x 1 + 2x 2 ≤8 x 1, x 2 ≥0 then,What is a basic solution in this problem?