ASSIGNMENT PROBLEM, Operation Research

Assignment Help:
. Explain in brief the phases of Operations Research. 5 +5 = 10 marks (200 - 250 words each) Q3. Solve the following Linear Programming Problem using Simple method.
Maximize Z= 3x1 + 2X2
Subject to the constraints:
X1+ X2 = 4
X1 - X2 = 2

Related Discussions:- ASSIGNMENT PROBLEM

PERT, how does it work

how does it work

LPP, A paper mill produces two grades of paper viz., X and Y. Because of ra...

A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper i

Solve lpp by using its duality, Maximize w = 5x -2y +3z subject to 2x +2y -...

Maximize w = 5x -2y +3z subject to 2x +2y -z>=2 y + 3z

Linear programming solution by steps for two-phase method, Solve by Steps f...

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

Verification of hypothesis, Analysis of Available Information and Verific...

Analysis of Available Information and Verification of Hypothesis: most of the time that a scientist spends in training is devoted to learning how to analyze and int

lp-model and markov decision problem, The supply of a certain good is insp...

The supply of a certain good is inspected periodically. If an order is placed of size x >0 (integer), the ordering costs are 8+2. x. The delivery time is zero. The demand is stoc

Models, Which model is described as a rule of thumb

Which model is described as a rule of thumb

1, A paper mill produces two grades of paper viz., X and Y. Because of raw ...

A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper i

Draw a network for the project adn determine the critical pa, a)Draw a netw...

a)Draw a network for the project. b)Determine the critical path. Activity Duration Activity Duration 1-2 15 5-10 22 1-3 13 6-9 33 1-4 1

LPP, Solve the following Linear Programming Problem using Simple method. Ma...

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

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd