@@ End of Day Wrap Sun 7/6/15 Sydney, Australia Time 1:35am (yes, it is Mon morn ) ♪ ♫
Hello everyone,
Our wonderful answerers today were Dragonlance, Radix, CPhill, Alan, Eloise, MathsGod1, Will85237 and asinus. Thank you
If you would like to comment on other site issues please do so on the Lantern Thread. Thank you.
Interest Posts:
FTJ means 'For the juniors'
1) Observation with Desmos calculator Thanks Dragonlance and Alan
2) Find maximum storage advanced Thanks CPhill
3) Integer addition FTJ Thanks asinus and Melody
4) This looks interesting - take a look at the link No answer yet
5) Factoring in pairs Melody
♫♪ ♪ ♫ ♬ ♬ MELODY ♬ ♬ ♫♪ ♪ ♫
Mon 8/6/15
If you would like to comment on other site issues please do so on the Lantern Thread. Thank you.
Interest Posts:
FTJ means 'For the juniors'
1) An unusual alternate base question. Melody
2) Another very unusual base question Melody
3) There are a lot of interesting different base questions on page 1843 AND 1844
Most are Mellie specials and some have not been answered yet. They are marked with "?" icons
4) Strange equation Advanced Not answered
5) Using Golden ratio Thanks Alan
6) Proof Advanced Not answered
♫♪ ♪ ♫ ♬ ♬ MELODY ♬ ♬ ♫♪ ♪ ♫
Let x be the number of "X" cabinets and y be the number of "Y" cabinets.
And we are told the following.......
x / y ≥ 2/3 → 3x ≥ 2y → y ≤ ( 3/2 ) x
100x + 200y ≤ 1400 ..... this is the cost constraint
.6x + .8y ≤ 7.2 .......this is the constraint on the square meters
We also need two more contraints: x ≥ 0 and y ≥ 0, since we can't have a negative number of cabinets!!!
And we want to maximize the cubic meters of file storage .......we can just call this..... .8x + 1.2y
Have a look at the graph of the inequalities, here.........https://www.desmos.com/calculator/rxzwqo3dnw
The maximum for the objective function occurs at a corner point in the feasible region......the graph shows that there are two "whole number" corner points at (8, 3) and (12, 0)....another corner point occurs at (3.5, 5.25)....but.....we can't buy "partial" numbers of cabinets.....!!!
Notice, at (8, 3), the objective function = .8(8) + 1.2(3) = 10
At (12, 0), the objective function = .8(12) + 1.2(0) = 9.6
It looks like the best option for maximum storage under the given constraints is to purchase 8 of the "X" cabinets and 3 of the "Y" cabinets
Sorry....I don't know a second method.....