Subject: Re: Linear programing
Date: Wed, 26 Mar 1997 23:47:32 -0500
From: James H.

Alex, thank you for pointing out where I "screwed up." Resolved the tableau;

The whole problem reads:

 Use the simplex method to solve the following:
 Maximize: Z = 2x1 - 6x2 [the 1 & 2 after the x are lowered]
 subject to:
              x1 - x2 <_ 4,
             -x1 + x2 <_ 4,
              x1 + x2 <_ 6,
              x1,x2  >_ 0

 the first tableau:

 Max. Z = 2x1 - 6x2 + 0s1 + 0s2 + 0s2

          x1     x2     s1     s2     s3
 Cb\Cj    2     -6      0      0      0

 s1  0    1     -1      1      0      0       4      pivot row
 s2  0   -1      1      0      1      0       4
 s3  0    1      1      0      0      1       6

 Zj       0      0      0      0      0       0
 Cj-Zj    2     -6      0      0      0
         pivot
         columm

Then, ? I am lost! Can you help?

James

|Reply| |Previous| |Next| |Down| |Exchange index| |Contents| |Store|

Copyright © 1996-2012 Alexander Bogomolny

 40614956

A math books store at a unique math study site. Shopping at the store helps maintain the site. Thank you.
Sites for teachers
Sites for parents
Terms of use
Awards
Interactive Activities

CTK Exchange
CTK Wiki Math
CTK Insights - a blog
Math Help
Games & Puzzles
What Is What
Arithmetic
Algebra
Geometry
Probability
Outline Mathematics
Make an Identity
Book Reviews
Stories for Young
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Proofs
Math as Language
Things Impossible
Visual Illusions
My Logo
Math Poll
Cut The Knot!
MSET99 Talk
Old and nice bookstore
Other Math sites
Front Page
Movie shortcuts
Personal info
Privacy Policy

Guest book
News sites

Recommend this site

Sites for parents

Education & Parenting

Search:
Keywords:

Google
Web CTK
Supported by
3wVentures