Assignment 1
Assignment 1
ASSIGNMENT NO. 01
OPERATIONAL RESEARCH
INSTRUCTOR: HAYAT ALI
SUBMISSION GUIDELINES
(i) Assignment must be submitted in hard form as well as soft form within due date.
(ii) Plagiarism is not allowed. In case of pledge, you will score zero marks.
(iii)Don’t submit your assignment after deadline.
(iv) Don’t copy from any other source.
(v) Its individual submission.
(vi) The deadline for this assignment is September 19, 2024.
Question:1
A factory manufactures chairs, tables and bookcases each requiring the use of three operations: Cutting,
Assembly, and Finishing. The first operation can be used at most 600 hours; the second at most 500
hours; and the third at most 300 hours. A chair requires 1 hour of cutting, 1 hour of assembly, and 1
hour of finishing; a table needs 1 hour of cutting, 2 hours of assembly, and 1 hour of finishing; and a
bookcase requires 3 hours of cutting, 1 hour of assembly, and 1 hour of finishing. If the profit is $20 per
unit for a chair, $30 for a table, and $25 for a bookcase, how many units of each should be
manufactured to maximize profit?
Question:2
Dean’s Furniture Company assembles regular and deluxe kitchen cabinets from precut lumber. The
regular cabinets are painted white, and the deluxe cabinets are varnished. Both painting and varnishing
are carried out in one department. The daily capacity of the assembly department is 400 regular
cabinets and 300 deluxe cabinets. Varnishing a deluxe unit takes twice as much time as painting a
regular one. If the painting/varnishing department is dedicated to the deluxe units only, it can complete
360 units daily. The company estimates that the revenues per unit for the regular and deluxe cabinets
are $100 and $140, respectively.
• Formulate the problem as a linear program, ensuring that one of the constraints is a "greater
than or equal to" (≥) inequality. Identify the objective function and all constraints.
• Using the Simplex Method, find the optimal production schedule per day.
• Suppose that competition dictates that the price per unit of each regular and deluxe cabinet be
reduced to $90. Use sensitivity analysis to determine whether or not the optimum solution in part 1
remains unchanged.
Question:3
This is your lucky day. You have just won a $20,000 prize. You are setting aside $8,000 for taxes and
partying expenses, but you have decided to invest the other $12,000.
Upon hearing this news, two different friends have offered you an opportunity to become a partner in
two different entrepreneurial ventures, one planned by each friend. In both cases, this investment
would involve expending some of your time next summer as well as putting up cash. Becoming a full
partner in the first friend’s venture would require an investment of $10,000
and 400 hours, and your estimated profit (ignoring the value of your time) would be $9,000. The
corresponding figures for the second friend’s venture are $8,000 and 500 hours, with an esti-
mated profit to you of $9,000. However, both friends are flexible and would allow you to come in at any
fraction of a full partnership you would like. If you choose a fraction of a full partner-
ship, all the above figures given for a full partnership (money investment, time investment, and your
profit) would be multiplied by this same fraction.
Because you were looking for an interesting summer job anyway (maximum of 600 hours), you have
decided to participate in one or both friends’ ventures in whichever combination would
maximize your total estimated profit. You now need to solve the problem of finding the best
combination.
• Formulate this problem as a linear programming model using the Big M method. Identify the
objective function and all constraints.
• Using the Simplex Method, find the maximum number of boxes that can be produced.
Question:5
The Green Garden Company grows two types of plants: roses and tulips. Each rose requires 3 units of
water and 2 units of fertilizer, while each tulip requires 2 units of water and 5 units of fertilizer. The
company has a maximum of 120 units of water and 100 units of fertilizer available for planting.
Additionally, the company wants to ensure that at least twice as many tulips as roses are planted to
meet customer demand.
• Formulate this problem as a linear programming model. Identify the objective function and all
constraints.
• Graph the feasible region determined by the constraints. Clearly label the axes, the feasible
region, and the vertices of the region.
• Determine the optimal number of roses and tulips to plant in order to maximize the total
number of plants.
GOOD LUCK ✌️