IE-OR Quiz NO. 2

Linear programming model which involves funds allocation of limited investment is classified as

• ordination budgeting model

• capital budgeting models

• funds investment models

• funds origin models

In linear programming, lack of points for a solution set is said to

• have no feasible solution

• have a feasible solution

• have single point method

• have infinte point method

In maximization problem, optimal solution occurring at corner point yields the

• mean values of z

• highest value of z

• lowest value of z

• mid values of z

In method of solving by enumeration, m constraints must be changed into equations by

• adding slack variables

• subtracting slack variables

• multiplying slack variables

• dividing slack variables

In method of solving by enumeration, two variables should be set as zero are classified as

• basic constant

• non basic constant

• optimal variable

• non basic variables

In minimization problem, better solution can be formed if positive quantities are assigned to

• positive basic variables

• negative basic variables

• negative non-basic variables

• positive non-basic variables

In less than or equal to constraint equations, variable which is used to balance both side of equations is classified as

• solving variable

• condition variable

• slack variable

• positive variable

In simplex method, slack, surplus and artificial variables are restricted to be

• multiplied

• negative

• non-negative

• divided

In simplex method basic solution set as (n-m), all variables other than basic are classified as

• constant variable

• non positive variables

• basic variables

• non-basic variable

In simplex method, feasible basic solution must satisfy the

• non-negativity constraint

• negativity constraint

• basic constraint

• common constraint