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!
Question:
(a) A company sells three different products X, Y and Z. The company makes a profit of Rs. 35, Rs. 50 and Rs. 60 per unit on products X, Y and Z respectively. The three products are produced in a common production process and are sold in three different markets. The total production process has a total capacity of 20000 man-hours. It takes two hours to produce a unit of X, three hours to produce a unit of Y and two hours to produce a unit of Z.
The market has been surveyed and it is found that the maximum units of X, Y and Z that can be sold are 12000, 8000 and 6000 respectively. Explain fully how you would formulate a linear programming model for this problem.
(b) A product mix problem can be formulated mathematically as follows:
Max Z = 100x1 + 75x2
subject to the constraints
5x1 + 10 x2 ≤ 1500 8x1 + 5x2 ≤ 1200 x1 ≤ 300 and x2 ≤ 400 x1 ≥ 0, x2 ≥ 0
Solve the above product mix problem using graphical method.
(c) Explain briefly the term ‘sensitivity analysis'.
#use the simple method to solve the following L.P.P. Maximize Z =4X1 +10X2 subject to constraints, 2X1 +X2 2X1+5X2 2X1 +3X2 X1,X2 > 0
How do I use C# to program an M/M/s queue model?
impact of operation research
Question A The basic characteristic feature of Operations Research is that it employs mathematical representations or models to analyse problems. Explain the methodology of Operat
Why Two regression Lines Once regression line cannot minimize the sum of square of deviations for both the x and Y series unless the relationship between them indicat
For every LP formulation there exists another unique linear programming formulation called the 'Dual' (the original formulation is called the 'Primal'). Same data
Solve by Steps for Two-Phase Method Max Z = 5x 1 + 8x 2 Subject to 3x 1 + 2x 2 ≥ 3 x 1 + 4x 2 ≥ 4 x 1 + x 2 ≤ 5 & x 1 ≥ 0, x 2 ≥ 0 Answe
Normal 0 false false false EN-IN X-NONE X-NONE
Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0
history of modi
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