Scribd
Upload
75 views12 pages

1 Linear Programming Samplequestions

The document describes an optimization problem to maximize profit from a construction project given constraints on land area, floor area ratio (FAR), unit area and profit for villas and flats, total budget, and construction costs. The objective is to maximize total profit by determining the number of villas (x) and flats (y) to build, subject to the given constraints. The problem is solved using the simplex and geometric methods.

Uploaded by

hserdar
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
75 views12 pages

1 Linear Programming Samplequestions

The document describes an optimization problem to maximize profit from a construction project given constraints on land area, floor area ratio (FAR), unit area and profit for villas and flats, total budget, and construction costs. The objective is to maximize total profit by determining the number of villas (x) and flats (y) to build, subject to the given constraints. The problem is solved using the simplex and geometric methods.

Uploaded by

hserdar
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/ 12

GOAL constraints: Method: simplex and geometric

Maximizing the profit from Land=50000m2


construction project FAR: 1,00
Villa (x)=625m2 Profit:10 million
Flat (y)=125m2 Profit:5 million
Budget: 60 billion
Construction cost: Villa: 800 million , Flat: 225 million

Answer: Max z= 10x+ 5y X=0 ; y=400 max z=2.000.000.000


Constraints
625x+125y≤ 50000
800x+ 225y ≤ 60000
x,y > 0
GOAL constraints: Method: simplex and geometric
Max z= 2x+0,5y 6x+5y ≤ 30 ,
4x+ y ≤ 12,
x,y ≥ 0

Answer: As the max z function and 4x+y=12 has the same slope, maximum value function overlaps with this
function. The intersection point of two constraints is ( 2,14 ; 3,43), x and y are greater than 0, All points between
point ( 2,14 ; 3,43) and point (3,0) can be solution. Thus, the solution is infinite.
Sample 1: Solve this problem with simplex and geometric methods.

Max z = 4 x + 4 y

Constraints:

2x + 7y ≤ 21

7x + 2y ≤ 49

x, y ≥ 0

Answer: X= 6,69 ; y=1,09 max z= 31,11


Sample 2:

GOAL constraints:
Max z = 6 x + 8 y 2x + 2y ≤ 240
4x + 8y ≤ 840
x, y ≥ 0

Answer: X=30 ; y=90 max z=900


GOAL constraints:
Max z = 9 x + 4 y 3x + 2y ≤ 12
x + 3y ≤ 9
x, y ≥ 0

Answer: X= 4; y=0 max z=36


GOAL constraints: Method: simplex and geometric
Max z = 40 x + 50 y x + 2y ≤ 40
3x + 2y ≤ 60
x, y ≥ 0

Answer: X=10 ; y=15 max z= 1150


GOAL constraints: Method: simplex and geometric
Max z = 12x + 8y 2x + 5y ≤ 10
3x + 6y ≤ 18
x,y ≥ 0

Answer: X= 5; y=0 max z=60


GOAL constraints: Method: simplex and geometric
Max z = 7x + 5y 3x + 3y ≤ 7
3x + 6y ≤ 12
x,y ≥ 0

Answer: X=2,33 ; y=0 max z=16,31


GOAL constraints: Method: simplex and geometric
Max z = 3x + 2y 4x + 2y ≤ 8
x + 4y ≤ 6
x,y ≥ 0

Answer: X=1,43 ; y=1,14 max z=6,57


GOAL constraints: Method: simplex and geometric
Max z = 3x + 7y 5x + 10y ≤ 18
2x + 4y ≤ 9
x,y ≥ 0

Answer: X=0; y=1,8 max z=12,6


GOAL constraints: Method: simplex and geometric
Max z = 10x + 6y 6x + 8y ≤ 24
4x + 12y ≤ 20
x,y ≥ 0

Answer: X=4 ; y=0 max z=40


GOAL constraints: Method: simplex and geometric
Maximizing the profit from Land=50000m2
construction project FAR: 1,00
Villa (x)=625m2 Profit:10 million
Flat (y)=125m2 Profit:5 million
Budget: 60 billion
Construction cost: Villa: 800 million , Flat: 225 million

Answer: Max z= 10x+ 5y X=4 ; y=0 max z=40


Constraints
625x+125y≤ 50000
800x+ 225y ≤ 60000
x,y > 0

You might also like