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

Operations research, What are artificial variable why do you need them

What are artificial variable why do you need them

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

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

Modi, there are 5 plants located in different cities and manufacturer a com...

there are 5 plants located in different cities and manufacturer a common produt A

Explain what do you understand by dynamic programming, Question: (a) (i...

Question: (a) (i) Explain what do you understand by ‘Dynamic Programming'. (ii) Describe the dynamic programming approach to solve the shortest route problem. (iii) Outli

Sample size in non propbability- sampling decisions, Sample Size in Non Pro...

Sample Size in Non Propbability The probability selection does not apply to purposive selection. The size of the non probability samples is selected in a subjective ma

Mathematical, Ask 7:23 PM Docx Reader GROUP-7 1. A firm manufactures two pr...

Ask 7:23 PM Docx Reader GROUP-7 1. A firm manufactures two products A & B on which the profits earned per unit is Rs.3 and Rs.4. Each product is processed on two machines Miand M2.

CONCEPT OF DUALITY IN LPP, EXPLAIN THE CONCEPT OF DUALITY IN LPP THROUGH A ...

EXPLAIN THE CONCEPT OF DUALITY IN LPP THROUGH A LIFE SITUATION

Formulate this as a Linear Programming Problem., A paper mill produces two ...

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

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

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

Linear programming , Solve the following Linear Programming Problem using S...

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!

Name

Email id

Message

Verfication Code

User Account

All Pages