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, explain the procedure of MODI method of finding solution throu...

explain the procedure of MODI method of finding solution through optimaly test.

Experimental design and methodology , Case Study - Experimental Design ...

Case Study - Experimental Design Dental Clinic A leading dental clinic  with  three well qualified  dentists is seriously  considering  keeping  in touch  with  its  pat

Non-governmental organisation, Name the feature which is not normally assoc...

Name the feature which is not normally associated with a Non-Governmental Organisation (NGO)?  Government funded is the organisation.

Linear Programming, A paper mill produces two grades of paper viz., X and Y...

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

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

Linear programming problem, A paper mill products two grade of paper viz., ...

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

Inventory Control Model, 1. A local university purchases exercise books to ...

1. A local university purchases exercise books to give to their students. Instead of a fixed unit cost, their supplier quotes the following discount pricing: Order quantity Unit P

Introduction to Operations research, discuss applications and scope of oper...

discuss applications and scope of operations research in diverse areas.

Linear programming problem, Solve the following Linear Programming Problem ...

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