Results 1 to 1 of 1

Thread: Linear Programming-Transportation Simplex

  1. #1
    Jun 2012
    United Kingdom

    Linear Programming-Transportation Simplex

    I don't know if I've posted this in the right place but I thought I'd give it a go anyway.

    For question see attachment below.

    So for part a) max z:150X11+350X12+300X13+100X21+500X22+400X23

    s.t. X11+X12+X13≤40

    For (b) eliminate first constraint and label constraints: u2,v1,v2,v3

    Then solve for us and vs and i get u1=0 u2=100 v1=0 v2=400 and v3=300

    Then c*12=50 so not optimal

    (c) Enter X12 into basis create loop etc. but that give new solution as X12=40, X21=30 and X23=60. But then when you go through us and vs again to test for optimality, you've got 5 variables to solve for and only four equations so I'm stuck. Help please!
    Attached Files Attached Files
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Linear Programming: Dual Simplex Method
    Posted in the Business Math Forum
    Replies: 0
    Last Post: May 8th 2012, 03:25 PM
  2. Linear Programming: Degeneracy in Simplex Method
    Posted in the Advanced Applied Math Forum
    Replies: 0
    Last Post: Nov 9th 2010, 05:18 PM
  3. Linear Programming - Simplex Method
    Posted in the Algebra Forum
    Replies: 5
    Last Post: Apr 13th 2010, 10:52 AM
  4. Transportation/Linear Programming problem help
    Posted in the Business Math Forum
    Replies: 0
    Last Post: Apr 9th 2010, 07:19 AM
  5. Linear Programming, simplex method
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: Feb 8th 2010, 07:05 PM

Search Tags

/mathhelpforum @mathhelpforum