Scribd
Upload
14 views2 pages

Or Case Study Final

The document discusses a group project applying operations research to optimize production levels for three products given resource constraints. It formulates the problem as a linear programming model to maximize total profit subject to carpentry, upholstery and painting hour constraints. The optimal solution is found using Excel solver to be x1=15, x2=30, x3=0 with maximum profit of 1500.

Uploaded by

gkolluri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views2 pages

Or Case Study Final

The document discusses a group project applying operations research to optimize production levels for three products given resource constraints. It formulates the problem as a linear programming model to maximize total profit subject to carpentry, upholstery and painting hour constraints. The optimal solution is found using Excel solver to be x1=15, x2=30, x3=0 with maximum profit of 1500.

Uploaded by

gkolluri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

GROUP PROJECT

M. Amulya reddy – 2023005206


Guna Shekhar – 2023001917
G.Vamshi krishna - 2023007407
K. Jagadishwar reddy -2023006936
Shiva prasad – 2023006124
DATE : 05-04-2024
SUBJECT : OPERATIONS RESEARCH
TITLE:APPLICATIONS OF OPERATIONS RESEARCH
PROBLEM:

Objective function:
Z (Maximize)= Z = 40x1 + 25x2 + 50 x3
Subject to the Constraints:
Carpentry (hrs) 4x1 + 2x2 + 6x3 ≤ 120
Upholstery (hrs) 0x1 + 3x2 + 5x3≤ 240
Painting (hrs) 2x1 + 2x2 + 2x3 ≤ 90
Non-negativity x1, x2 ≥ 0
We have formulated the above in excel using SUMPRODUCT function

bed MAX

Using solver function we have inserted the three constraints and non negativity
criteria
Using simplex LP method in solver we get out optimal solution for the given
constrains

INTERPRETATION:
Here are the optimal values for x1 and x2, as well as the maximum value of (z)
X1=15, X2=30, X3=0
So, the maximum value of (z) is 1500, and this occurs when (x1 = 15), (x2 = 30)
and (x3 = 0)
Maximize(Z) = 40x1 + 25x2 + 50x3
40(15) + 25(30) + 50(0) = 1350

You might also like