1.

The first step in formulating an LP problem is

graph the problem.

perform a sensitivity analysis.
identify the objective and the constraints.
define the decision variables.

Ans. D

2. Consider the following linear programming problem:

Maximize 12X + 10Y
Subject to: 4X + 3Y ≤ 480
2X + 3Y ≤ 360
all variables ≥ 0
Which of the following points (X,Y) is feasible?

(10,120)
(120,10)
(30,100)
(60,90)
none of the above

Ans. C

3. The difference between the left-hand side and right-hand side of a less-than-or-equal-to
constraint is referred to as
slack.
surplus.
constraint.
shadow price.
E) None of the above

Ans. A

4. Inthe simplex method, the slack, surplus and artificial variables are
restricted to be

Multiplied

negative

non-negative

divided

Ans. C
5. If an algorithm achieves an approximation ratio of ϱ (n), we call it a ___________

ϱ (n) -approximation algorithm

ϵ- approximation algorithm

ϵ+1 approximation algorithm

ϱ (n+1) approximation algorithm

Ans. A

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

constant variable

non positive variables

basic variables

non-basic variable

Ans: D

7. In simplex method, the feasible basic solution must satisfy the

non-negativity constraint

negativity constraint

basic constraint

common constraint

Ans: A
8. The objective of linear programming for an objective function is to

maximize or minimize

subset or proper set modeling

row or column modeling

adjacent modeling
Ans. A

9.In linear programming, the objective function and objective constraints

are

solved

linear

quadratic

adjacent

ans. B

10. A company manufactures two products X and Y. Each product has to be processed in
three departments: welding, assembly and painting. Each unit of X spends 2 hours in the
welding department, 3 hours in assembly and 1 hour in painting. The corresponding times
for a unit of Y are 3, 2 and 1 hours respectively. The employee hours available in a month
are 1,500 for the welding department, 1,500 in assembly and 550 in painting. The
contribution to profits are Rs.100 for product X and Rs.120 for product Y.
What is the objective function (Z) to be maximised in this linear
programming problem (where Z is total profit in Rs)? 
Z = 2X + 3Y
Z = 1500X + 1500Y
Z = 100X + 120Y
Z = 120X + 100Y

Ans. C