can someone help me with simplex LP from numerical recipes

From: Anu (dr_anumathew_at_hotmail.com)
Date: 11/23/04 

Date: 23 Nov 2004 05:11:33 -0800

Hi,

I am trying to write an optimization code (maximization) in C++ and am
using the code from Numerical recipes. However, I am stuck trying to
solve the example problem given in the text book itself. With this
example, the algorithm finds that there is no feasible solution exists
(since teh auxiliary objective function is still negative after a
couple of attempts). I have no idea why this happens, even though I
get the results given in the book (if I debug my code).

Can someone help me with this problem. I am not very particular about
using LP simplex given in this book. If someone can send me a code
that works, I would really appreciate it.

many thanks in advance.

Anu