Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
61 views

Central University of Kerala: "Linear Programming"

The document contains 10 questions related to formulating linear programming problems. The questions describe various production, resource allocation, and optimization scenarios and ask to formulate each as a linear program with objectives, constraints, and variables defined.

Uploaded by

Zea Zake
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
61 views

Central University of Kerala: "Linear Programming"

The document contains 10 questions related to formulating linear programming problems. The questions describe various production, resource allocation, and optimization scenarios and ask to formulate each as a linear program with objectives, constraints, and variables defined.

Uploaded by

Zea Zake
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 19

CENTRAL UNIVERSITY OF KERALA

DEPARTMENT OF MANAGEMENT STUDIES

MBG5203: Operations Research

Assignment On

"Linear programming”

Submitted By

AMITHA JOSE

(BMG052008)

Submitted To

Dr. K A GERMINA

Submitted On: 30/06/2021


Questions
Question 1:
A milk plant manufactures two types of products A and B and sells them at a profit of Rs. 5
on type A and Rs. 3 on type B. Each product is processed on two machines G and H. Type
A requires one minute of processing time on G and two minutes on H; type B requires one
minute on G and one minute on H. The machine G is available for not more than 6 hours
40 minutes, while machine B is available for 8 hours 20 minutes during any working day;
formulate the problem as LP problem.

Question 2:
A dairy plant packs two types of milk in pouches viz., full cream and single toned. There are
sufficient ingredients to make 20,000 pouches of full cream and 40,000 pouches of single toned.
But there are only 45,000 pouches into which either of the products can be put. Further it takes
three hours to prepare enough material to fill 1000 pouches of full cream milk one hour for
1000 pouches of single toned milk and there are 66 hours available for this operation. Profit is
Rs. 8 per pouch for full cream milk and Rs. 7 per pouch for single toned milk. Formulate it as a
linear programming problem.

Question 3:
Consider two different types of food stuffs say F1 and F2. Assume that these food stuffs
contain vitamin A and B. Minimum daily requirements of vitamin A and B are 40mg and
50mg respectively. Suppose food stuff F1 contains 2mg of vitamin A and 5mg of vitamin B while
F2 contains 4mg of vitamin A and 2mg of vitamin B. Cost per unit of F1 is Rs. 3 and that of F2
is Rs. 2.5. Formulate the minimum cost diet that would supply the body at least the minimum
requirements of each vitamin.

Question 4:
We want to feed the cattle in a farm using a diet as cheap as possible. Such diet must
contains four types of nutrients that will call A, B, C, and D. This components can be found
in two kind of fodders, M and N. The amount of every component in grams per kilogram of
these fodders is shown in the next table:

A B C D

M 100 - 100 200

N - 100 200 100

An animal's daily diet must be mixed at least with 0.4Kg of A component, 0.6Kg of B
component, 2Kg of C component and 1.7Kg of D component. The M fodder cost 0.2€/Kg and the N
fodder 0.08€/Kg. What quantities of fodders M and N must be purchased to minimize the cost?

1
Question 5:
A cargo plane has three compartments for storing cargo: front, centre and rear. These
compartments have the following limits on both weight and space:
Compartment Weight capacity Space capacity (cubic metres)
(tonnes)
Front 10 6800
Centre 16 8700
Rear 8 5300

Furthermore, the weight of the cargo in the respective compartments must be the same
proportion of that compartment's weight capacity to maintain the balance of the plane.
The following four cargoes are available for shipment on the next flight:

Cargo Weight Volume (cubic Profit (£/tonne)


(tonnes) metres/tonne)
C1 18 480 310
C2 15 650 380
C3 23 580 350
C4 12 390 285

Any proportion of these cargoes can be accepted. The objective is to determine how much
(if any) of each cargo C1, C2, C3 and C4 should be accepted and how to distribute each
among the compartments so that the total profit for the flight is maximised. Formulate the
above problem as a linear program.

Question 6:
A canning company operates two canning plants. The growers are willing to supply fresh
fruits in the following amounts:

 S1: 200 tonnes at £11/tonne


 S2: 310 tonnes at £10/tonne
 S3: 420 tonnes at £9/tonne
 Shipping costs in £ per tonne are:
Plant B
To: Plant A
From: S1 3 3.5

S2 2 2.5

S3 6 4

2
Plant capacities and labour costs are:

Plant A Plant B
Capacity 460 560
Labour cost 26 21

The objective is to find the best mixture of the quantities supplied by the three growers to
the two plants so that the company maximises its profits. Formulate the problem as a linear
program and explain it.

Question 7:
The production manager of a chemical plant is attempting to devise a shift pattern for his
workforce. Each day of every working week is divided into three eight-hour shift periods
(00:01-08:00, 08:01-16:00, 16:01-24:00) denoted by night, day and late respectively. The
plant must be manned at all times and the minimum number of workers required for each of
these shifts over any working week is as below:

Mon Tues Wed Thu Fri Sat Sun


Night 5 3 2 4 3 2 2
Day 7 8 9 5 7 2 5

Late 9 10 10 7 11 2 2

The union agreement governing acceptable shifts for workers is as follows:


1. Each worker is assigned to work either a night shift or a day shift or a late shift and once a
worker has been assigned to a shift they must remain on the same shift every day that they
work.
2. Each worker works four consecutive days during any seven day period.
In total there are currently 60 workers. Formulate the production manager's problem as a linear
program.

Question 8:
A company manufactures four products (1,2,3,4) on two machines (X and Y). The time
(in minutes) to process one unit of each product on each machine is shown below:
Machine X Y
Product 1 10 27

2 12 19

3 13 33

4 8 23

The profit per unit for each product (1,2,3,4) is £10, £12, £17 and £8 respectively. Product 1 must
be produced on both machines X and Y but products 2, 3 and 4 can be produced on either machine.

3
The factory is very small and this means that floor space is very limited. Only one week's
production is stored in 50 square metres of floor space where the floor space taken up by each
product is 0.1, 0.15, 0.5 and 0.05 (square metres) for products 1, 2, 3 and 4 respectively.

Customer requirements mean that the amount of product 3 produced should be related to the
amount of product 2 produced. Over a week approximately twice as many units of product 2
should be produced as product 3.

Assuming a working week 35 hours long formulate the problem of how to manufacture
these products as a linear program.

Question 9:
A company is planning its production schedule over the next six months (it is currently the
end of month 2). The demand (in units) for its product over that timescale is as shown below:

Month 3 4 5 6 7 8
Demand 5000 6000 6500 7000 8000 9500

The company currently has in stock: 1000 units which were produced in month 2; 2000
units which were produced in month 1; 500 units which were produced in month 0.

The company can only produce up to 6000 units per month and the managing director has
stated that stocks must be built up to help meet demand in months 5, 6, 7 and 8. Each unit
produced costs £15 and the cost of holding stock is estimated to be £0.75 per unit per month
(based upon the stock held at the beginning of each month).The company wants a production
plan for the next six months that avoids stockouts. Formulate their problem as a linear
program.

Question 10:

A company assembles four products (1, 2, 3, 4) from delivered components. The profit per
unit for each product (1, 2, 3, 4) is £10, £15, £22 and £17 respectively. The maximum
demand in the next week for each product (1, 2, 3, 4) is 50, 60, 85 and 70 units respectively.

There are three stages (A, B, C) in the manual assembly of each product and the man-
hours needed for each stage per unit of product are shown below:

Product 1 2 3 4
Stage A 2 2 1 1
B 2 4 1 2
C 3 6 1 5
4
The nominal time available in the next week for assembly at each stage (A, B, C) is 160, 200
and 80 man-hours respectively.

It is possible to vary the man-hours spent on assembly at each stage such that workers
previously employed on stage B assembly could spend up to 20% of their time on stage A
assembly and workers previously employed on stage C assembly could spend up to 30% of
their time on stage A assembly.

Production constraints also require that the ratio (product 1 units assembled)/(product 4 units
assembled) must lie between 0.9 and 1.15.
Formulate the problem of deciding how much to produce next week as a linear program.

Question 11:
A company makes three products and has available 4 workstations. The production time (in
minutes) per unit produced varies from workstation to workstation (due to different manning
levels) as shown below:
Workstation 1 2 3 4
Product 1 5 7 4 10
2 6 12 8 15
3 13 14 9 17

Similarly the profit (£) contribution (contribution to fixed costs) per unit varies from
workstation to workstation as below

Workstation 1 2 3 4
Product 1 10 8 6 9
2 18 20 15 17
3 15 16 13 17

If, one week, there are 35 working hours available at each workstation how much of each
product should be produced given that we need at least 100 units of product 1, 150 units of
product 2 and 100 units of product 3. Formulate this problem as an LP.

You might also like