Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
ABC Company manufactures both interior and exterior paints from 2 raw materials M1 and M2. The following table gives basic data of problem.
Exterior paint
Interior paint
Availability
N1
6
4
24
N2
1
2
Profit per ton
5
A market survey signifies that every day demand for interior paint cannot surpass that for exterior paint by more than 1 ton. Also maximum routine demand for interior paint is 2 tons. Develop LPP to find out the top product mix of interior and exterior paints that maximizes the daily total gain (profit).
Answer
Assume
x1 - number of units of exterior paint
x2 - number of units of interior paint
Maximize Z = 5x1 + 4x2
Subject to
6x1 + 4x2 ≤ 24
x1 + 2x2 ≤ 6
x2 - x1≤ 1
x2≤ 2
x1≥0, x2 ≥0
b) The highest routine demand for exterior paint is almost 2.5 tons
x1≤ 2.5
c) Routine demand for interior paint is as a minimum 2 tons
x2 ≥ 2
d) Routine demand for interior paint is accurately 1 ton more than that for exterior paint.
x2 > x1 + 1
a manufacture wants to ship 8 loads of his product as shown below. The matrix gives the mileage from origin to the destination D.
Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0
applications of operation research
Importance of models
RANGE Range is the difference between the highest and the lowest value is series. This is the simplest absolute measure of dispersion. Symbolically : R= L- S
Normal 0 false false false EN-IN X-NONE X-NONE
model building is the essence of the operational research discuss
Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignment
solve the following linear programming problem using simplex method maximize z=3x1+2x2 subject to the constraints: x1+x2 x1+x2 x1,x2>=0
Answering Question to Finding Shortest Path - Operation Research Assignment Help Finding answers for shortest path problems are quite interesting and not easy to solve. In solv
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd