Maximizing Profit with Machine Constraints in Linear Programming, Exams of Mathematics

A linear programming problem from a mechanical engineering exam at cork institute of technology. The problem involves a manufacturing company, dme4 ltd., which produces three products x, y, and z, and must decide how many units of each product to produce in-house and buy from outside sources to meet demand while maximizing profit. The problem is formulated as a linear programming problem and includes machine time requirements and profit per unit for in-house and bought-in products.

Typology: Exams

2012/2013

Uploaded on 03/28/2013

pinkee
pinkee 🇮🇳

4.4

(17)

115 documents

1 / 8

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Cork Institute of Technology
Bachelor of Engineering (Honours) in Mechanical Engineering- Award
(NFQ Level 8)
Summer 2007
Mathematics
(Time: 3 Hours)
Instructions:
Answer FOUR questions.
All questions carry equal marks.
Statistical tables are available.
Examiners: Mr. D. O’Hare
Mr. P. Clarke
Prof. M. Gilchrist
pf3
pf4
pf5
pf8

Partial preview of the text

Download Maximizing Profit with Machine Constraints in Linear Programming and more Exams Mathematics in PDF only on Docsity!

Cork Institute of Technology

Bachelor of Engineering (Honours) in Mechanical Engineering- Award

(NFQ Level 8)

Summer 2007

Mathematics

(Time: 3 Hours)

Instructions: Answer FOUR questions. All questions carry equal marks. Statistical tables are available.

Examiners: Mr. D. O’Hare Mr. P. Clarke Prof. M. Gilchrist

  1. (a) DME4 Ltd. produces three products X, Y, and Z. The company is planning production for the upcoming period, during which the required numbers of units of X, Y, and Z are 220, 310 and 350 respectively. Two machines, A and B, are used in the production of all three products. Machine A will be available for 180 hours and machine B for 160 hours during the period. Details of the machine times required are shown below. If necessary, some product may be bought in from an outside source, repackaged and sold on. Up to 40 units of X, up to 80 units of Y and an unlimited number of Z may be acquired in this way. For product manufactured in-house, profit per unit is €45 for X, €60 for Y and €75 for Z; for product bought in and repackaged, profit per unit is €10, €12 and €18, respectively, for X, Y and Z. Machine time (minutes/unit) A B X 17 12 Product Y 14 10 Z 12 19 (i) How many decision variables are there in this problem? Define them clearly. (ii) Formulate the problem of maximising profit while satisfying demand as a linear programming problem. Do not solve the problem you formulate. (8 marks) (b) Decision variables, slack variables and artificial variables occur in the solution of linear programming problems by the simplex method, though all three types will not necessarily appear in every problem. Distinguish between the three types of variable and indicate the circumstances in which each type is appropriate. How many variables would be involved in the solution of the problem in part (a) using the Simplex method? (4 marks) (c) Solve the problem 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3

Minimise 2 9 4 subject to 2 3 4 12 2 4 4 8 3 , , 0.

z x x x x x x x x x x x x x x x

(13 marks)

  1. (a) (i) Explain the terms balanced transportation problem and dummy source. (ii) Why are there m+n-1 basic variables in a basic feasible solution to a balanced mxn transportation problem? (3 marks)

(b) A personnel manager has recently hired 25 workers, each of whom will work in either assembly, machining, packing or inspection. 15 of the workers are classified as apprentices while the remaining 10 are classified as experienced. The company has developed productivity measures for the workers as follows:

Productivity per worker by position Assembly Machining Packing Inspection Apprentice 58 62 76 29 Experienced 73 94 81 56 Seven workers each are required in assembly, machining, and packing, while four are needed in inspection. Solve the problem of allocating workers to departments so as to maximise the overall sum of productivity measures. (14 marks)

(c) The following is an ANOVA table for a randomised block design:

Source Sum of squares df Mean Square F Factor * 4 13307.75 * Blocks * * 38739.25 * Error * 12 * Total 171119.75 19

(i) Fill in the values denoted by * in the ANOVA table. (ii) How many factor levels and how many blocks are involved? (iii) What conclusion do you draw from the table and why? (8 marks)

  1. (a) Three types of material are compared with respect to their compressive strengths.

The following data were gathered:

Box Type Compressive Strength 1 565.5 788.3 734.3 721. 2 789.2 772.5 786.9 686. 3 535.1 628.7 542.8 559. Produce a one-way ANOVA table based on these data and state your conclusions clearly. (10 marks) (b) The data below resulted from a 2^3 experiment designed to study the effects of concentration of detergent (A), concentration of sodium carbonate (B), and concentration of sodium carboxymethyl cellulose (C) on cleaning ability of a solution in washing tests. A larger number indicates better cleaning ability than a smaller number. Two observations were taken at each combination of factor levels.

Test Observations (1) 106, 93 a 198, 200 b 197, 202 ab 329, 331 c 149, 169 ac 243, 237 bc 255, 230 abc 383, 360 (i) Calculate estimates of the main effects and the two-factor interactions. (ii) Test the significance of the various effects. (iii) What would your recommendation be based on the evidence of these data? (15 marks) Note that (^) S (^) e^2 = 112