Introduction on Linear Programming

Solve the following questions

1. A transport company has two types of trucks, Type A and Type B. Type A has a
refrigerated capacity 20m of and a non-refrigerated capacity of 40m3 while Type B has
the same overall volume with equal sections for refrigerated and non-refrigerated stock.
A grocer needs to hire trucks for the transport of 3000m3 of refrigerated stock
and 4000m of non-refrigerated stock. The cost per kilometer of a Type A is 30 and, 40
for Type B. How many trucks of each type should the grocer rent to achieve the
minimum total cost?

2. Minimize 160x + 150y

Subject to:
2x + 3y ≥ 150
X + 4y ≥  400
5x + 2x ≥   100
X ≥ 0, y ≥  0

3. Her MAJESTY Nigeria Ltd. Produces two types of bricks “Hard” and “SOFT”. The
contribution to profit is 500 birr and 400 birr respectively. The bricks have to pass
through three departments during production. The labor hours required and available
for each product in each department is given in the table below:

PRODUCT MIXING PACKING MOLDING

Hard 10 3 2
Soft 5 2 3
Maximum hours 800 300 600
available

A. How many units of each product should be produced to maximize the profit?
 4. Solve graphically

Minimize    z = 0.3x + 0.45y

Subject to:
X + Y ≥ 10
X–Y≥0
2x + 3x ≤ 30
X ≥ 0, Y ≥ 0

5. SoftStudyNg.com produces two types of software say X and Y. The raw materials
constraints for X and Y are:

3x + 4y < 270
6x + 5y ≤ 600
The profit margin per unit for type X is N80.00 while that of type Y is N120.00. What
should be the production plan that will maximize the profit? What is the maximum
contribution?

6. Richard plc. Makes two types of biscuit x1 and x2 each of which requires passing through
three sections of the production; mixing, heating, and packing. The number of hours
required to complete each process for a unit of the biscuit is given below:

MIXING HEATING PACKING

X1 120 50 150
X2 100 150 50

The hours available for each of the section is 480 hours. If the contribution to profit of
x1 is 850 birr and x2 is 800 birr. How many units of each product should be produced to
make a maximum profit?
 Choose the best answer

7. In a linear programing problem, the objective function is always

A. Cubic
B. Quadratic
C. Linear
D. Constant

8. Maximize Z = -x+ 2y, subject to the constrains: x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0.

A. Maximize Z = 12 at (2, 6)
B. Z has no Maximize value
C. Maximize Z = 10 at (2,6)
D. Maximize Z = 14 at (2,6)

9. A linear programming problem is one that is concerned with

A. Finding the upper limits of a linear function of several variables

B. Finding the lower limit of a linear function of several variables
C. Finding the limiting values of a linear function of several variables
D. Finding the optimal value( maximum and minimum) of a linear function of
several variables

10. Which of the following problems cannot be solved by linear programming method?

A. Diet problem
B. Transportation problem
C. Manufacturing problem
D. Traffic Signal control

11. The optimal value of the objective function Z = ax +by may or may not exist, If feasible
region for a Linear programming problem is

A. A circle
B. A polygon
C. Bounded
D. Unbounded
12. One kind of cake requires 200g of flour and 25kg of fat, and another kind of cake
requires 100g of flour and 50g of fat. Find the maximum number of cakes which can be
made from 5 kg of flour and 1 kg of fat assuming that there is no shortage of other
ingredients used in making the cakes.

A. Maximum number of cakes = 30, 20 of kind one and 10 cakes of another kind
B. Maximum number of cakes = 32, 20 of kind one and 12 cakes of another kind
C. Maximum number of cakes = 34, 27 of kind one and 7 cakes of another kind
D. Maximum number of cakes = 32, 22 of kind one and 11 cakes of another kind

13. In linear programming feasible region for the problem is

A. The common region by all the constrains including the non – negative constrains
x>0
y >0
B. The common region determined by all the x > 0 and the objective function
C. The common region determined by all the objective function including the non –
negative constrains x > 0, y >0
D. The common region determined by all the x > 0, y >0 and the objective function.

14. In a LPP(Linear programming problem), if the objective function Z = ax + by has the same
maximum value at two corner points of the feasible region then every point on the line
segment joining these two points give the same

A. Maximum value
B. Mean Value
C. Minimum value
D. Upper limit value

15. In LPP, the linear inequalities or restrictions on the variables are called

A. Inequalities
B. Linear constraints
C. Constraints
D. Limits
16. In linear programming infeasible solutions

A. Fall on the x = 0 plane

B. Fall inside the feasible region
C. Fall outside the feasible region
D. Fall inside the regular polygon

17. In linear programming problems the function whose maxima or minima are to be found
is called

A. Delta function
B. Selection function
C. Subjective function
D. Objective function

18.
19. In linear programming, Optimal solution

A. Satisfies all the constraints only

B. Is not unique
C. Satisfies all the constraints as well as the objective function
D. Maximize the objective function only

20.