OCR MEI D2 linear programming simplex algorithm

Maths and statistics discussion, revision, exam and homework help.

Announcements Posted on
IMPORTANT: You must wait until midnight (morning exams)/4.30AM (afternoon exams) to discuss Edexcel exams and until 1pm/6pm the following day for STEP and IB exams. Please read before posting, including for rules for practical and oral exams. 28-04-2013
Sign in to Reply
  1. Nightingale's Avatar
    • Exalted Member
    • Posts: 258
    OCR MEI D2 linear programming simplex algorithm
    This is taken from the June 2007 paper, question 4 iii)
    I am not able to follow the mark scheme at all and I don't know if I'm completely missing the point, because I initially thought the algorithm should have been two stage simplex due to the > constraint.
    here's the question and I attached the solutions from the mark scheme. So it is just part iii) that I'm not understanding. If you can spot the link between the previous parts and this one please post a comment.


    Noel is designing a hotel patio. It will consist of decking and paving.
    Decking costs £4 per m2 and paving costs £2 per m2. He has a budget of £2500.
    Noel prefers paving to decking, and he wants the area given to paving to be at least twice that given to decking.
    He wants to have as large a patio as possible.
    Noel’s problem is formulated as the following LP.
    Let x be the number of m2 of decking.
    Let y be the number of m2 of paving.

    (i) Use the simplex algorithm to solve this LP. Pivot first on the positive element in the y column.

    Noel would like to have at least 200m2 of decking.
    (ii) Add a line corresponding to this constraint to your solution tableau from part i), and modify the resulting table either for two-stage simplex or the big-M method. Hence solve the problem.

    Noel finally decides that he will minimise the annual cost of maintenance, which is given by subject to the additional constraint that there is at least 1000 m2 of patio.

    (iii) Starting from your solution to part (ii), use simplex to solve this problem.
    Attached Thumbnails
    Click image for larger version. 

Name:	i) and ii).png 
Views:	35 
Size:	45.7 KB 
ID:	151602   Click image for larger version. 

Name:	iii).png 
Views:	18 
Size:	29.3 KB 
ID:	151603  
    Last edited by Nightingale; 27-05-2012 at 13:37.
  2. Coursework.info's Avatar
    • Retired TSR Help Bot
    • Location: That galaxy over there
    OCR MEI D2 linear programming simplex algorithm
    It's been a while since you posted and nobody's replied yet...maybe you should check out MarkedbyTeachers.com, TSR's sister site. It has the largest library of essays in the UK.

    They've got over 181,000+ coursework, essays, homeworks etc.. all written by GCSE, A Level, University and IB students across all topics. You get access either by publishing some of your own work, or paying £4.99 for a month's access. Both ways give you unlimited access to all of the essays.

    All their documents are submitted to Turnitin anti-plagiarism software, so it can't be misused, and the site's used by hundreds of thousands of UK teachers and students.

    What's more, you can take a look around the site and preview the work absolutely free. Click here to find out more...
  3. hayzelle's Avatar
    • Respected Member
    • Location: Hitchin, England
    • Posts: 238
    Re: OCR MEI D2 linear programming simplex algorithm
    I'm stuck with the exact same bit, the solution seems to make no sense!
Sign in to Reply
Share this discussion:  
Article updates
Moderators

We have a brilliant team of more than 60 volunteers looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

Reputation gems:
The Reputation gems seen here indicate how well reputed the user is, red gem indicate negative reputation and green indicates a good rep.
Post rating score:
These scores show if a post has been positively or negatively rated by our members.