linear programming, 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 programming

Modi method, find optimal solution for a 3*4 matrix 42 27 24 35 46 37 32 3...

find optimal solution for a 3*4 matrix 42 27 24 35 46 37 32 32 40 40 30 35 using modi method

Simplex method, Solve the following Linear Programming Problem using Simple...

Solve the following Linear Programming Problem using Simplex method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Mba , in a rectangular game pay off matrix of player a is as follows ...

in a rectangular game pay off matrix of player a is as follows B1 B2 A1 5 7 A2 4 0 salve the game write down the pay off matrix of B and then solve the ga

Inventory control research, Given an inventory system where Yearly demand ...

Given an inventory system where Yearly demand = 120 units Ordering cost = Sh. 45 Price per unit = Sh. 200 Annual carrying cost = 24% of the unit cost Determine The economic or

Describe multinational corporations, Question 1 -Though society as well as...

Question 1 -Though society as well as culture do not appear to be a part of business situations, yet they are actually key elements in showing how business activities will be cond

Explain briefly the term sensitivity analysis, Question: (a) A company...

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 th

Introduction to probability distribution , Introduction to Probability Dist...

Introduction to Probability Distribution By  theoretical distribution we mean  a frequency distribution  which  is obtained  in relation to a random  variable by some  mathem

Modeling process, What are the basic 5 elements of modeling process

What are the basic 5 elements of modeling process

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

Transpotation problem, a manufacture wants to ship 8 loads of his product a...

a manufacture wants to ship 8 loads of his product as shown below. The matrix gives the mileage from origin to the destination D. Origin Destination Available A B C X 50 30 220

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