Scribd
Upload
188 views

Assignment # 01

This document contains 11 questions related to linear programming problems. Question 1 asks a farmer to determine how many acres to plant of corn and wheat to maximize revenue given constraints on labor hours, land acres, and minimum corn production. Question 2 asks whether several combinations of corn and wheat acres are feasible solutions to Question 1.

Uploaded by

Asra Akram
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
188 views

Assignment # 01

This document contains 11 questions related to linear programming problems. Question 1 asks a farmer to determine how many acres to plant of corn and wheat to maximize revenue given constraints on labor hours, land acres, and minimum corn production. Question 2 asks whether several combinations of corn and wheat acres are feasible solutions to Question 1.

Uploaded by

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

Department of Computer Science & Information Technology

Operation Research & Optimisation (CT-503)


MS (CSIT) Evening Program

Assignment # 01

Linear Programming problem (simple case)


Question # 01:
Farmer Jones must determine how many acres of corn and wheat to plant this year. An acre of wheat yields 25
bushels of wheat and requires 10 hours of labor per week. An acre of corn yields 10 bushels of corn and
requires 4 hours of labor per week. All wheat can be sold at $4 a bushel, and all corn can be sold at $3 a
bushel. Seven acres of land and 40 hours per week of labor are available. Government regulations require that
at least 30 bushels of corn be produced during the current year. Let x1 = number of acres of corn planted, and
x2 = number of acres of wheat planted. Using these decision variables, formulate an LP whose solution will
tell Farmer Jones how to maximize the total revenue from wheat and corn.

Question # 02:
Answer these questions about the above question # 01.
(a) Is (x1 = 2, x2 = 3) in the feasible region?
(b) Is (x1 = 4, x2 = 3) in the feasible region?
(c) Is (x1 = 2, x2 = -1) in the feasible region?
(d) Is (x1 = 3, x2 = 2) in the feasible region?

The Graphical Solution


Question # 03:
Leary Chemical manufactures three chemicals: A, B, and C. These chemicals are produced via two production
processes: 1 and 2. Running process 1 for an hour costs $4 and yields 3 units of A, 1 of B, and 1 of C.
Running process 2 for an hour costs $1 and produces 1 unit of A and 1 of B. To meet customer demands, at
least 10 units of A, 5 of B, and 3 of C must be produced daily. Graphically determine a daily production plan
that minimizes the cost of meeting Leary Chemical’s daily demands.

Special Cases (I. Alternative or Multiple Optimal Solutions, II. Infeasible LP,
and III. Unbounded LP)
Question # 04:
Identify which of the special Cases (a and b) apply to each of the following LPs:
Max z   x1  3 x2 Max z  3 x1  x2
s.t . x1  x2  4 s.t . 2x1  x2  6
(a) x1  2 x2  4 (b) x1  3 x2  9
x1 , x2  0 x1 , x2  0

1
A diet Problem
Question # 05:
There are three factories on the Momiss River (1, 2, and 3). Each emits two types of pollutants (1 and 2) into
the river. If the waste from each factory is processed, the pollution in the river can be reduced. It costs $15 to
process a ton of factory 1 waste, and each ton processed reduces the amount of pollutant 1 by 0.10 ton and the
amount of pollutant 2 by 0.45 ton. It costs $10 to process a ton of factory 2 waste, and each ton processed will
reduce the amount of pollutant 1 by 0.20 ton and the amount of pollutant 2 by 0.25 ton. It costs $20 to process
a ton of factory 3 waste, and each ton processed will reduce the amount of pollutant 1 by 0.40 ton and the
amount of pollutant 2 by 0.30 ton. The state wants to reduce the amount of pollutant 1 in the river by at least
30 tons and the amount of pollutant 2 in the river by at least 40 tons. Formulate an LP that will minimize the
cost of reducing pollution by the desired amounts. Do you think that the LP assumptions (Proportionality,
Additivity, Divisibility, and Certainty) are reasonable for this problem?

A Work Scheduling Problem


Question # 06:
In the post office example, suppose that each full-time employee works 8 hours per day. Thus, Monday’s
requirement of 17 workers may be viewed as a requirement of 8(17) = 136 hours. The post office may meet its
daily labor requirements by using both full-time and part-time employees. During each week, a full-time
employee works 8 hours a day for five consecutive days, and a part-time employee works 4 hours a day for
five consecutive days. A full-time employee costs the post office $15 per hour, whereas a part-time employee
(with reduced fringe benefits) costs the post office only $10 per hour. Union requirements limit part-time
labor to 25% of weekly labor requirements. Formulate an LP to minimize the post office’s weekly labor costs.

An Inventory Model
Question # 07:
A customer requires during the next four months, respectively, 50, 65, 100, and 70 units of a commodity (no
backlogging is allowed). Production costs are $5, $8, $4, and $7 per unit during these months. The storage
cost from one month to the next is $2 per unit (assessed on ending inventory). It is estimated that each unit on
hand at the end of month 4 could be sold for $6. Formulate an LP that will minimize the net cost incurred in
meeting the demands of the next four months.

Linear Programming Models: (Solution by Simplex Method) Resource


Allocation Model
Question # 08:
A company manufactures three products namely X, Y and Z. Each of the products requires processing on three
machines, Turning, Milling and Grinding. Product X requires 10 hours of turning, 5 hours of milling and 1
hour of grinding. Product Y requires 5 hours of turning, 10 hours of milling and 1 hour of grinding, and
Product Z requires 2 hours of turning, 4 hours of milling and 2 hours of grinding. In the coming planning
period, 2700 hours of turning, 2200 hours of milling and 500 hours of grinding are available. The profit
contribution of X, Y and Z are Rs. 10, Rs.15 and Rs. 20 per unit respectively. Find the optimal product mix to
maximize the profit.

Question # 09:
A company deals with three products A, B and C. They are to be processed in three departments X, Y and Z.
Products A require 2 hours of department X, 3 hours of department Y and product B requires 3 hours,2 hours
and 4 hours of department X, Y and Z respectively. Product C requires 2 hours in department Y and 5 hours in
department Z respectively. The profit contribution of A, B and C are Rs. 3/–, Rs.5/– and Rs. 4/– respectively.
Find the optimal product mix for maximizing the profit. In the coming planning period, 8 hours of department
2
X, 15 hours of department Y and 10 hours of department Z are available for production.

Question # 10:
Solve the Minimization L.P.P. given below by using Two-Phase method.

Min z  x1  3 x2  2 x3
s.t . 3x1  1x2  3 x3  7
-2x1  4 x2  0 x3  12
-4x1  3 x2  8 x3  10
x1 , x2 , x3  0

Question # 11:
A company manufactures two products X and Y on three machines Turning, Milling and finishing machines.
Each unit of X takes, 10 hours of turning machine capacity, 5 hours of milling machine capacity and 1 hour of
finishing machine capacity. One unit of Y takes 6 hours of turning machine capacity, 10 hours of milling
machine capacity and 2 hours of finishing machine capacity. The company has 2500 hours of turning machine
capacity, 2000 hours of milling machine capacity and 500 hours of finishing machine capacity in the coming
planning period. The profit contribution of product X and Y are Rs. 23 per unit and Rs. 32 per unit
respectively. Formulate the linear programming problems and write the dual.

Please Note: Final Date of Induvial Assignment Submission: Sunday 18th August 2019

You might also like