Module 3: Last Question! (MAX Profit?)

[magnum]

SCREW YOU, VCAA. That's 1 mark gone. Already. Heavens knows how many more to come.

Was that max. profit question worth 1 mark?

It was worth 2 marks, but im guessing VCAA gave 1 mark for the answer and 1 mark for providing the profit equation (P=1300x + 2100y)

[dior1]

^ I forget to put the P in the equation haha.

[Tobyy]

thats what i got

Was i wrong to use the point  (2,7) to get the maximum profit??

Was i wrong to use the point  (2,7) to get the maximum profit??

[stonecold]

The 2006 Exam 2 had virtually the same type of question. The coordinate for max profit did not lie on the intersection of 2 lines, same as this year.

[VxBlitzxN]

because i used the integer thingy, where you use the most near 8 solutions at the max point.

Yerh, I also used that integer rule of thumb for this integer programming problem.
The text book saids so =.=   and (2,7) is not point near that

The 2006 Exam 2 had virtually the same type of question. The coordinate for max profit did not lie on the intersection of 2 lines, same as this year.

That question used the integer rule. The point of intersection then form a 8 point box around it. so yerh :S

[Hooligan]

SCREW YOU, VCAA. That's 1 mark gone. Already. Heavens knows how many more to come.

Was that max. profit question worth 1 mark?

It was worth 2 marks, but im guessing VCAA gave 1 mark for the answer and 1 mark for providing the profit equation (P=1300x + 2100y)

Oh no... I wrote the Profit equation above the question, 'cause I didn't think that would get me one of the marks, considering it didn't ask for you to state or write down the profit equation....

[stonecold]

Can't say i've heard of this integer rule before.  But yeah, i just checked every coordinate which was an integer and close to or on the boundary.  Took me a couple of minutes but it was worth it.

[arthurjamesd]

you cant have 'half a flight', in this right, you can't round any flights up either, its either a full flight or no flight. Food for thought

[Zoe]

I didn't even think twice that you couldn't have .5 of a flight!
Ah VCAA, You win again.

[Ilovemathsmeth]

because i used the integer thingy, where you use the most near 8 solutions at the max point.

Yerh, I also used that integer rule of thumb for this integer programming problem.
The text book saids so =.=   and (2,7) is not point near that

I knowww =(

[blinded]

Surely you can average 4.5 and 5.5 flights per day though? Making the maximum daily profit $17400.

A flight can start on one day and finish on the next day. Over 10 days you could 45 X flights and 55 Y flights, meet all the constraints and make $174000 profit, $17400 per day.

[lachymm]

^^^^ i doubt you are right but i hope so

[Ilovemathsmeth]

I reckon you could average it, but it isn't feasible though =(

[pirocan1]

Is it always a boundary point? Cause ive heard that it can be another number point in the feasible region.

[kenhung123]

That integer rule is interesting...so if the corner point is a decimal that produces a max, that means the integer max is within 8 points around it in the feasible region?