Problems based on lpp when feasible region is a line segment, Operation Research

Assignment Help:

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

script

solution

1. Let z = 2x+3y

2. Let us draw lines X +y = 1 and x + y = 3using suitable points on the graph.

3. There is no common region satisfying the given conditions

X +y = 1 and x + y = 3

Related Discussions:- Problems based on lpp when feasible region is a line segment

Linear programming, Ask question #Minimum 100 words acceptNas food produces...

Ask question #Minimum 100 words acceptNas food produces to kinds of popular dark chocolate bars. the banana and coffee. the banana bar costs 0.22 to make and sells of 0.35, where a

Assignment, discuss about assignment and steps involved in it

discuss about assignment and steps involved in it

Non measurable human factors, Operation research makes no allowance for in...

Operation research makes no allowance for intangible factors such as skill attitude vigor of the management people in taking decisions but in many instances success or fail

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

Methods of calculation of standard deviation , Methods of calculation of ...

Methods of calculation of standard deviation a. Calculation of Standard Deviation - Individual Series: There are two methods of calculating standard deviation in an ind

Lpp linear programming problems exercise, Exercise Define the t...

Exercise Define the terms used in LPP. Mention the advantages of LPP. What are the assumptions and limitations of LPP? A firm produces three pro

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

. 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

MINIMIZATION., Consider the LP min ?? = 50??1 + 100??2 3 ??.??. 7??1+2??2=2...

Consider the LP min ?? = 50??1 + 100??2 3 ??.??. 7??1+2??2=28 2??1+12??2=24 ??1,??2=0 a. A basic solution of the constraint equations of this problem has how many basic variables,

OPERATION RESEARCH, 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

Game thoery, In a rectangular game, pay-off matrix of player A is as follow...

In a rectangular game, pay-off matrix of player A is as follows: i) Solve the game. ii) Write down the pay-off matrix of B and then, solve the game.

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages