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/11/2013 2:22:18 PM | Location : USA

Ask an Expert

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

Write discussion on LPP
Your posts are moderated

Write your message here..

Related Questions

Short question, write down any two assumption of L.P write down any two assumption of L.P

Quantitative Technique for business, Davidson construction company is build... Davidson construction company is building a luxury lakefront home in batangas coordination of the architech an sub contractors will require a major effort to meet the 44-week (appr

Sample survey methods:, Sample Survey Methods: If proposed investigati... Sample Survey Methods: If proposed investigation is done  only on  a part taken  out of  universe then it  will be  known  as sample  survey. This  part of the universe is kno

Equation, 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

Books - report writing presentation , Books a. One author : Authors... Books a. One author : Authors  last name  first name title  of books place of publication: publisher copyright data page numbers used. b. Two Author : First  author  la

Tower of hanoi problem, Step 1: Research Towers of Hanoi problem The Tow... Step 1: Research Towers of Hanoi problem The Towers of Hanoi is a problem frequently used to teach recursive programming techniques. Step 2: Run the assembly code from Hanoim

Assignment problem, Six Operators are to be assigned to five jobs with the ... Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignment

Replacement theory, cumulative discount factor cumulative discount factor

#title.L.L.p, #use the simple method to solve the following L.P.P. Maximi... #use the simple method to solve the following L.P.P. Maximize Z =4X1 +10X2 subject to constraints, 2X1 +X2 2X1+5X2 2X1 +3X2 X1,X2 > 0

Decide upon the objective , Decide upon  the Objective  What is it... Decide upon  the Objective  What is it that you  aim to  achieve  the end  of the  presentation ? your  objective  should  be crystal  clear. Do  not stray or move  a ways