A furniture warehouse sells 2 types of furniture, flix and flox.

The maximum sales of flix are 5500, and 3,500 flox.

x= the number of flix
y= the number of flox

The objective function is C=24x + 20y

Direct Labour:The supply of grade A labour is restricted to 9,000 hour but is

freeley avaliable for grade B labour.

Machine time: The hours avaliable for macine type 1 are 5000, and 8000 for

machine type 2.

Flix require 2hrs of grade A labour, 1 hr of B labour, a hour of machine 1 and

1 hour of macinhe 2.

Flox require 1.5hrs Grade A, 2hrs Grade B, 1 hr machine type 1, and 2 hours

machine type 2/

So I set up the linear programme:

Maximise profits for: P= 24x + 20y
Subject to:
2x+1.5y <= 9000
1x+2y >=0
1x+2y <= 5000
1x + 2y <=8000

x,y >= 0

Then solve using the simplex algorithm

But when I solve using a simplex algorithm I find that x and y =0 which cant be right, because you need to sell something to make profit. I was wondering wether I set the linear program up wrong.