Solve by simplex method, Operation Research

Solve by simplex method

  1. Maximize Z = 5x1 + 3x2

Subject to

3x1 + 5x2 ≤ 15

5x1 + 2x2 ≤ 10

&         x1 ≥ 0, x≥ 0

[Ans. Max Z = 235/19, x1= 20/19, x2= 45/19]

 

  1. Maximize Z = 5x1 + 7x2

Subject to

x1 + x2 ≤ 4

3x1 - 8x2 ≤ 24

10x1 + 7x2 ≤ 35

&         x1 ≥ 0, x≥ 0

[Ans. Max Z = 28, x1= 0, x2= 4]

 

 

 

 

  1. Maximize Z = 2x1 + 4x2 + x3+ x4

Subject to

x1 + 3x2 + x4 ≤ 4

2x1 + x2 ≤ 3

x2 + 4x3 + x4 ≤ 3

&         x1 ≥ 0, x≥ 0, x≥ 0, x≥ 0

[Ans. Max Z = 13/2, x1= 1, x2= 1, x3= 1/2, x4= 0]

 

  1. Maximize Z = 7x1 + 5x2

Subject to

-x1 - 2x2 -6

4x1 + 3x2 ≤ 12

&         x1 ≥ 0, x≥ 0

[Ans. Max Z = 21, x1= 3, x2= 0]

 

  1. Maximize Z = 3x1 + 2x2

Subject to

2x1 + x2 ≤ 10

x1 + 3x2 ≤ 6

x1 + x2 ≤ 21

&         x1 ≥ 0, x≥ 0

Posted Date: 7/5/2012 1:54:15 AM | Location : United States







Related Discussions:- Solve by simplex method, Assignment Help, Ask Question on Solve by simplex method, Get Answer, Expert's Help, Solve by simplex method Discussions

Write discussion on Solve by simplex method
Your posts are moderated
Related Questions
write the scope of operation research

Model building is the essence of the operations research approach? Discuss. question #Minimum 100 words accepted#

Simple Graph The values of the two variables are plotted on a graph paper. We get two curves one for x variables and another for y  variables. These  two curves reveal the dir

SING TEST The sign test  is the simplest  of the  parametric  tests. Its name comes  from the  fact  that it is based  on the direction ( or sings  for  pluses or minuses ) of

#question.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.

A constraints in an LPP restricts? (Value of objective function,Value of decision variable,Use of available resources, uncertainty of optimum value) please help me to find out righ

DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH IN MODERN MANAGEMENT

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

The systematic methodology developed for an operation research study with problems involving conflicting multiple objective policies and alternatives. Operation research in

Operation Research may be regarded as a tool which is utilized to increase the effectiveness of the management decisions. O R is objective supplement to the subjective feeling