Linear programming-how to find max/min points where non-integer solutions?

[panda31]

Hi everyone,
Just wondering if someone could explain to me how to determine the max/min values for the objective function if the corner-points are decimals/not integers and the question wants integer solutions?
Also, I'm confused about what this sliding ruler technique is?

Thanks!:)

[TrueTears]

http://en.wikipedia.org/wiki/Lagrange_multiplier

Very easy to program into MATLAB/R/Mathematica if you give me the exact specification of your objective function (as long as it's not a functional cause those are nasty ).

[Lasercookie]

http://en.wikipedia.org/wiki/Lagrange_multiplier

Very easy to program into MATLAB/R/Mathematica if you give me the exact specification of your objective function (as long as it's not a functional cause those are nasty ).

Probably overkill for Further Year 12 Maths

[kaiipoo_]

Use a ruler, and let your objective function equal to a number where x an y factor in.

For example, 3x + 6y = 12.

Plot this line in dotted lines, place your ruler on it, and slide it up ensuring it's parallel. Another ruler perpendicular to slide it on is also helpful. I havn't done it since term 2 but i think the last point the ruler touches is maxima and the first point is minima. Test the discrete co-ordinates around this point and find maxima/minima by substituting into objective function.

lemme know how you go

[Stick]

Hi everyone,
Just wondering if someone could explain to me how to determine the max/min values for the objective function if the corner-points are decimals/not integers and the question wants integer solutions?
Also, I'm confused about what this sliding ruler technique is?

Thanks!:)

If you're not a fan of the sliding line technique, you can test points that are near the vertices of the feasible region. It's time consuming and probably worth leaving to the end if it comes up in the exam since this particular part is generally only worth 2 marks.