Linear programimg, Operation Research

Assignment Help:
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

Related Discussions:- Linear programimg

Problems based on lpp when feasible region is a line segment, Problems base...

Problems based on LPP when feasible region is a line segment or it does not exist. 1.    Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X,  y ≥ 0

test statistic - hypothesis testing , Test Statistic The next  step ...

Test Statistic The next  step is compute an appropriate  test statistic which  is based on an appropriate probability distribution. It  is used to test whether the null  hypo

#title.sum., a company produces 150 cars. but the production rate varies wi...

a company produces 150 cars. but the production rate varies with the distribution.

Inventory control of any company, give real data & find out the inventory &...

give real data & find out the inventory & give suggestions

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

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

Principles of construction of research tool, Principles of Construction of ...

Principles of Construction of Research Tool Content of research tool should be based on aims and need of research problem: The questioning words must be concise compreh

One sample runs test - hypothesis testing, ONE SAMPLE  RUNS  TEST A ...

ONE SAMPLE  RUNS  TEST A number of  methods have been  developed fro  judging the randomness of samples on the basis of  the order in which  teh observations  are taken. It is

Simplex solution, difference between simplex solution procedure for maximis...

difference between simplex solution procedure for maximisation and minimisation

Network problem, Consider the following network where the value on each arc...

Consider the following network where the value on each arc represents the capacity of that arc. Use the augmenting path algorithm to find the value of the maximum flow from node 1

Sequencing, how the sequencing techniques help the manager

how the sequencing techniques help the manager

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