Optimization Techniques Quiz

How is an linear programming problem changed into an integer programming problem?

• by adding constraints that the decision variables be non-negative

• by adding integrality conditions

• by adding discontinuity constraints

• none of these

The Branch and Bound algorithm solves integer programming problems

• by solving for each variable separately

• by solving for the integer variables first

• by solving a series of linear programming problems

• none of these

In the B & B algorithm, B & B stands for ………..

• Brooks and Baker

• Best Bound

• Branch and Bound

• none of these

An integrality condition indicates that some (or all) of the ………

• objective function coefficients must be integer

• constraint coefficients must be integer

• decision variables must be integer

• none of these

Region represented by x ≥ 0, y ≥ 0 is ………

• first quadrant

• second quadrant

• third quadrant

• fourth quadrant

The objective function of a linear programming problem is:

• a constraint

• function to be optimised

• A relation between the variables

• None of these

Which of the following is a type of Linear programming problem?

• Manufacturing problem

• Diet problem

• Transportation problems

• All of the above

Customer behavior in which the customer moves from one the queue to another in a multiple channel situation is ………..

• balking

• reneging

• jockeying

• alternating

Which of the following characteristic apply to the queuing system

• customer population

• arrival process

• both (a) & (b)

• neither (a) nor (b)

The calling population is assumed to be infinite when ……….

• arrivals are independent of each other

• the capacity of the system is infinite

• both (a) & (b)

• neither (a) nor (b)