Indian Institute of Technology (BHU) Varanasi

CSM 324: Operations Research

Problem Sheet 1

Topics Covered: Graphical Solution, BFS, Convex Set and Standard LPP

1. Find the corner points of the feasible region and solve the following LPPs graphically.
(a) Maximize
Subject to

(b) Minimize
Subject to

2. Solve the following two problems graphically and show that the problems have the same
optimum value.
(i) Minimize
Subject to

(ii) Maximize
Subject to

3. Show that the following two problems have infinite number of optimal solutions.
(a) Maximize
Subject to
 .

(b) Maximize 6
Subject to

4. Show that the following LPP admits unbounded solution

Maximize
Subject to

5. Show that the following LPP have no feasible solution

Maximize
Subject to

6. A factory is engaged in manufacturing two products and which involve lathe work,
grinding and assembling. The cutting, grinding and assembling times required for one unit of
are 2, 1 and 1 hour respectively, and for one unit of are 3, 1 and 3 hours respectively. The
profits on each unit of and are Rs. 2 and Rs. 3 respectively. Assuming that hours of
lathe time, hours of grinding time and hours of assembling time are available, pose a
linear programming problem in terms of maximizing the profit on the items manufactured.

7. A transport company has offices in five localities, A, B, C, D and E. Someday the offices
located at A and B had 8 and 10 spare trucks whereas offices at C, D, E required 6, 8 and 4
trucks respectively. The distances in kilometers between the five localities are given below

To C D E
A 2 5 3
From
B 4 2 7

How should the trucks from A and B be sent to C, D and E so that the total distance covered
by the trucks is minimum? Pose the problem as an LPP.
8. Find all the basic feasible solutions of the equations

9. Is the solution ( ) a basic solution of the equations

? Justify.

10. Show that the feasible solution to the system

is not basic.

11. Show that ( ) is a basic solution of the equations

is a basic solution.

12. Show algebraically that the following sets are convex.

(i) *( ) +
(ii) *( ) +.

13. Graph the convex hull of the points ( )( )( )( ) ( ). Which of these

points is an interior point of the convex hull? Express it as a convex combination of the
extreme points.

14. Put the following LPP in a standard maximization form:

Maximize
Subject to

| |
and is unrestricted in sign.

**************
 Problem Sheet 1: Hints and Solutions

1. (a) Corner points: ( )( ) ( ) ( ) ( ).

Optimum point: ( )

Solution: .

(b) (Note that the third constraint is redundant.)

Corner points: ( )( )( )( )( ).

Optimum point: ( )
Solution: .

2. Such two problems are called dual to each other. We will have lecture class on the theory of
duality.

(i) Minimum point is ( ) and minimum value is .

(ii) Maximum point is ( ) and maximum value is .

3. (a) Graphical presentation of the feasible solution

Solution Table

Point
O 0 0 0
A 0 2 20
B 0 20
C 2.8125 0.3125 20
D 0 5 50
E 3 0 18

(b) Similar to (a).

7. Minimize
Subject to

8. ( )

9. No

13. ( )