simplex method, Operation Research

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
Posted Date: 2/13/2013 4:02:14 AM | Location : USA







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

Write discussion on simplex method
Your posts are moderated
Related Questions
Example 2 Max Z = 3x 1 - x 2 Subject to             2x 1 + x 2 ≥ 2             x 1 + 3x 2 ≤ 3             x 2 ≤ 4     &     x 1 ≥ 0, x 2  ≥ 0   A


Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X 1, X2 = 0

Assumption of F- Test The  theoretical assumption on which  F test  is based are: 1.The populations for  each sample must  be normally  distributed  with  identical  mean

Meaning and Definition If a group  of N observations is  arranged in ascending or descending  order of magnitude then the  middle  value is  called  median of  these  observat

in a rectangular game ,pay of matrix of player A is as follows

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

These models are used when one must decide the optimal time to replace equipment for one reason or the other for instance, in the case of equipment whose efficiency dete

krr emee ee

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 in