Maximize

subject to

a)with Graphical method of Linear programming

b)with Simplex method of Linear programming

Thnak you in advance.

Printable View

- January 2nd 2009, 09:20 AMabstarLinear programming
Maximize

subject to

a)with Graphical method of Linear programming

b)with Simplex method of Linear programming

Thnak you in advance. - January 2nd 2009, 10:10 AMLast_Singularity
Please show us your work and let us know where you get stuck; we are not here to do out the entire problem for you.

To get you started, denote as . Declare your objective function .

Then your constraints become

The last two constraints can be ignored, as the Simplex Method itself requires all variables to be nonnegative. In other words, as you carry out your pivots correctly, the minimal ratio test will ensure that your variables say nonnegative.

For these three constraints, introduce slack variables and use that as your initial basis for a feasible tableau:

maximize

Your basis is currently [3,4,5] with an objective value of 0. Since both of them have positive reduced costs, choose one of as the entering variable k.

Can you take it from there? Check your answers by comparing the graphical and the Simplex method - they should agree with each other. - January 3rd 2009, 06:42 AMentrepreneurforum.co.uk
i've started to do this and got as far as the formulas part, i'm trying to work outthe new values in the new table

where R3 is the pivot row

row1 = (R1-R3)

row2 = (r2-2(r3)

row4 = (R4 + 2(r3)

also is it always Rx - Pivot row, i get confused on the formula section, the rest i think im ok with. Could someone please explain what to do here?

my pivot table is attached to this thread, could someone have a look and check for me please? - January 4th 2009, 02:48 PMDeMath
a) with Graphical method of Linear programming

http://s39.radikal.ru/i086/0902/98/accdf9493f05.jpg

is a normal-vector