Scribd
Upload
13 views

Linear Programming

The document provides examples of linear programming problems and their solutions using different methods. It includes transportation problems to be solved using northwest corner rule and least cost methods. Graphical and simplex methods are applied to sample optimization problems with constraints to maximize or minimize objectives.

Uploaded by

Vongai Mushaba
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
13 views

Linear Programming

The document provides examples of linear programming problems and their solutions using different methods. It includes transportation problems to be solved using northwest corner rule and least cost methods. Graphical and simplex methods are applied to sample optimization problems with constraints to maximize or minimize objectives.

Uploaded by

Vongai Mushaba
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

NATIONAL UNIVERSITY OF SCIENCE AND TECHNOLOGY

FACULTY OF COMMERCE
DEPARTMENT OF INSURANCE AND ACTUARIAL SCIENCE
QUANTITATIVE ANALYSIS FOR BUSINESS

TUTORIAL: LINEAR PROGRAMMING

1. A manufacturer makes motorized and manual hand trucks in a factory that is divided into
2 shops. Shop 1 which performs the basic assembly operation must work 5 hours on each
motorized hand truck but only 2 hours on each manual hand truck. Shop 2 performs
finishing operations and must work 3 hours on each motorized and manual hand truck it
produces. Because of the limited number of workers and machines, shop 1 has 180 hours
available per week and shop 2 has 135 hours available per week. If the manufacturer
makes a profit of $300 on each motorized hand truck and $200 on each manual hand
truck. Write a linear programme to maximize profit.

2. A manufacturer makes wooden desks (X) and table (Y). Each desk requires 2,5 hours to
assemble, 3 hours for buffing and 1 hour to crate. Each table requires 1 hour to assemble,
3 hours to buff and 2 hours to crate. The firm can do only up to 20 hours of assembling,
30 hours of buffing and 16 hours of crating per week, profit is $3 per desk and $4 per
table. Formulate a linear programming problem that maximizes profit.

3. A company Kango produces two kinds of gadgets, gadgets A and B. Each item of gadget
A takes 5 hours to produce, and each item of gadget B takes 2 hours. There is $3.00 profit
for each gadget A produced and $2 profit for each gadget B produced. Due labour
restrictions, no more than 200 productions are available. In addition, marketing dictates
that no more than 60 of gadgets of A and B may be produced. In addition, no more than
30 gadgets can be produced. The manager of Kango wants to know the optimal
combination of product A and B to produce. Formulate a mathematical model, that is
formulate the linear programming and:

(i) Graph the feasible region


(ii) Hence determine, the Kango’s optimal policy
4. Using the graphical Method, solve the following linear programming problem:
𝑀𝑎𝑥 𝑍 = 5𝑥1 + 4𝑥2
6𝑥1 + 4𝑥2 ≤ 24
Subject to: 𝑥1 + 2𝑥2 ≤ 6
−𝑥1 + 𝑥2 ≤ 1
𝑥2 ≤ 2
𝑥1 , 𝑥2 ≥ 0

5. Given the following linear programming model, solve using the graphical method.
Max Z = 2x1 + 3x2
Subject to: 𝑥1 + 𝑥2 ≤ 100
4𝑥1 + 8𝑥2 ≤ 500
𝑥1 , 𝑥2 ≥ 0
6. Solve the following minimization problem using the graphical method:
𝑀𝑖𝑛 𝑍 = 15𝑥1 + 20𝑥2
Subject to: 𝑥1 + 2𝑥2 ≥ 10
2𝑥1 − 3𝑥2 ≤ 6
𝑥1 + 𝑥2 ≥ 6
𝑥1 , 𝑥2 ≥ 0
7. Solve the following minimization problem using the graphical method:
𝑀𝑖𝑛 𝑧 = 2𝑥1 + 3𝑥2
Subject to 𝑥1 + 𝑥2 ≥ 100
4𝑥1 + 8𝑥2 ≥ 500
𝑥1 , 𝑥2 ≥ 0
8. Solve the following linear programming problem using the simplex method:
𝑀𝑎𝑥 𝑍 = 500𝑥1 + 450𝑥2
Subject to 6𝑥1 + 5𝑥1 ≤ 60
𝑥1 + 2𝑥2 ≤ 15
𝑥1 ≤ 8
𝑥1 , 𝑥2 ≥ 0
9. Solve the following linear programming problem using both the simplex method and the
graphical method:
𝑀𝑖𝑛 𝑍 = 35𝑥1 + 28𝑥2
Subject to 20𝑥1 + 10𝑥2 ≥ 20
12𝑥1 + 18𝑥2 ≥ 18
𝑥1 , 𝑥2 ≥ 0
10. Solve the following linear programming problem using both the simplex method and the
graphical method:
𝑀𝑎𝑥 𝑍 = 2𝑥1 + 3𝑥2
Subject to 𝑥1 + 2𝑥2 ≤ 8
2𝑥1 + 3𝑥2 ≤ 15
𝑥1 , 𝑥2 ≥ 0
11. A company has factories at A, B and C with supply warehouses M, N, P, and Q.
Monthly factor capacities are 300, 400, and 500 respectively. Monthly warehouse
requirements are 200, 240, 280, and 340 respectively.
Unit transportation cost are given in the Table.

FROM↓ TO→ M N P Q
A 7 9 9 6
B 6 10 12 8
C 9 8 10 14
REQUIREMENTS

Suggest the optimum transpotation solution, using both the North West Corner Method and Least
Cost method.

12. Solve the following transportation problem:


FROM↓ TO→ A B C AVAILABILITY
1 50 30 220 1
2 90 45 170 3
3 250 200 50 4
REQUIREMENTS 4 2 2
13. Formulate a linear programming model for the following transportation problem and
solve using the North West corner method and the least cost method.

You might also like