D1 - Simplex algorithm question

Question paper :

www.ocr.org.uk/Images/57757-question-paper-unit-4736-decision-mathematics-1.pdf

Mark scheme :

http://www.ocr.org.uk/Images/61150-mark-scheme-january.pdf

Question 6) part iii

I understand how you work out the values of p and x from the table but how does you get the values of y and z as what they are ???

Also the last part iv)

I don't understand it can someone please explain it?

Reply 1

tea_light

Original post by IShouldBeRevising_

For part (iii) y and z aren't assigned to any particular row so they both equal zero. Remember the algorithm works by increasing the decision variables in turn to find the optimal value of P, similar to vertex testing, so this means by default all decision variables start as 0.

Part (iv) can be explained as the most (and only) negative value in row P consists of all negative entries. This means the problem cannot be solved as we cannot proceed to compare pivot entries as they will all be below 0 (which the algorithm is supposed to ignore).

Quick Reply

Related discussions

Latest

Articles for you

Btec results day 2024: what to expect

What is an LLM and how could it benefit your career?

Powerful questions business students forget to ask their career advisers

Why I chose a law degree and what studying law was like