Scribd
Upload
7 views2 pages

Test 4

The document presents multiple linear programming problems, both maximization and minimization, with various objective functions and constraints. Each problem specifies the variables x and y must be non-negative and includes a set of inequalities that define the feasible region. The objective functions aim to optimize the values of Z based on the given constraints.

Uploaded by

Praveen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views2 pages

Test 4

The document presents multiple linear programming problems, both maximization and minimization, with various objective functions and constraints. Each problem specifies the variables x and y must be non-negative and includes a set of inequalities that define the feasible region. The objective functions aim to optimize the values of Z based on the given constraints.

Uploaded by

Praveen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Max Z = 40x + 50y Max Z = 15 x +10 y Max Z = 80x +120y Max Z = 150x +250y

Subject to: Subject to: Subject to: Subject to:


3x + y ≤ 9 2x + y ≤ 40 3x + 4y ≤ 60 x + y ≤ 35
x + 2y ≤ 8 2x + 3y ≤ 80 x + 3y ≤ 30 x + 2y ≤ 50
x ≥ 0, y ≥ 0 x ≥ 0, y ≥ 0 x ≥ 0, y ≥ 0 x ≥ 0, y ≥ 0

Max Z = 40x + 50y Max Z = 15 x +10 y Max Z = 80x +120y


Max Z = 150x +250y
Subject to: Subject to: Subject to:
Subject to:
3x + y ≤ 9 2x + y ≤ 40 3x + 4y ≤ 60
x + y ≤ 35
x + 2y ≤ 8 2x + 3y ≤ 80 x + 3y ≤ 30
x + 2y ≤ 50
x ≥ 0, y ≥ 0 x ≥ 0, y ≥ 0 x ≥ 0, y ≥ 0
x ≥ 0, y ≥ 0

Max Z = 40x + 50y Max Z = 15 x +10 y


Max Z = 80x +120y Max Z = 150x +250y
Subject to: Subject to:
Subject to: Subject to:
3x + y ≤ 9 2x + y ≤ 40
3x + 4y ≤ 60 x + y ≤ 35
x + 2y ≤ 8 2x + 3y ≤ 80
x + 3y ≤ 30 x + 2y ≤ 50
x ≥ 0, y ≥ 0 x ≥ 0, y ≥ 0
x ≥ 0, y ≥ 0 x ≥ 0, y ≥ 0

Max Z = 40x + 50y Max Z = 15 x +10 y


Max Z = 80x +120y
Subject to: Subject to: Max Z = 150x +250y
3x + y ≤ 9 2x + y ≤ 40 Subject to:
Subject to:
x + 2y ≤ 8 2x + 3y ≤ 80 3x + 4y ≤ 60 x + y ≤ 35
x ≥ 0, y ≥ 0 x ≥ 0, y ≥ 0 x + 3y ≤ 30
x + 2y ≤ 50
x ≥ 0, y ≥ 0
x ≥ 0, y ≥ 0
Min Z = 225x + 300y Min Z = 10x + 8y Min Z = 2x + y Min Z = 5x + 7y
Subject to: Subject to: Subject to: Subject to:
3x + 5y ≥ 90 3x + y ≥ 300 3x + y ≥ 9 2x + y ≥8
x+y≥8 x + y ≥ 240 x+y≥7 x + 2y ≥ 10
x ≥ 0, y ≥ 0 x ≥ 0, y ≥ 0 x ≥ 0, y ≥ 0 x ≥ 0, y ≥ 0

Min Z = 225x + 300y Min Z = 10x + 8y Min Z = 2x + y Min Z = 5x + 7y

Subject to: Subject to: Subject to: Subject to:


3x + 5y ≥ 90 3x + y ≥ 300 3x + y ≥ 9 2x + y ≥8
x+y≥8 x + y ≥ 240 x+y≥7 x + 2y ≥ 10
x ≥ 0, y ≥ 0 x ≥ 0, y ≥ 0 x ≥ 0, y ≥ 0 x ≥ 0, y ≥ 0

Min Z = 225x + 300y Min Z = 10x + 8y Min Z = 2x + y Min Z = 5x + 7y

Subject to: Subject to: Subject to: Subject to:


3x + 5y ≥ 90 3x + y ≥ 300 3x + y ≥ 9 2x + y ≥8
x+y≥8 x + y ≥ 240 x+y≥7 x + 2y ≥ 10
x ≥ 0, y ≥ 0 x ≥ 0, y ≥ 0 x ≥ 0, y ≥ 0 x ≥ 0, y ≥ 0

Min Z = 10x + 8y Min Z = 2x + y Min Z = 5x + 7y


Min Z = 225x + 300y
Subject to: Subject to: Subject to:
Subject to:
3x + y ≥ 300 3x + y ≥ 9 2x + y ≥8
3x + 5y ≥ 90
x + y ≥ 240 x+y≥7 x + 2y ≥ 10
x+y≥8
x ≥ 0, y ≥ 0 x ≥ 0, y ≥ 0 x ≥ 0, y ≥ 0
x ≥ 0, y ≥ 0

You might also like