Dear c++ or advanced computer scienctist or mathmatician:

on the book(Introduction to Algorithms 3rd ed) page 851, chapter 29

Linear Programming

I ask one of that book's author:

-----------------------------------------------

dear thomas:

the the end of that page

if a linear program has some feasible solutions but does not have a

finite optimal objective value, we say that the linear program is

unbounded

but

you want us to prove in Exercise 29.1-9

to show

that a linear program can have a finite optimal objective value even

if

the feasible region is not bounded

which is very unlogical for me

looking to hear from you soon

Eric

------------------------------------------------------------------

Eric, you'll have to think outside the box just a little bit. It may

seem illogical, but there's a simple solution.

Tom Cormen

Professor and Chair

Dartmouth College Department of Computer Science

http://www.cs.dartmouth.edu/~thc/
-----------------------------------------------------

but I still not figure out

plz give hint/suggestion/advice, thank your help/effort/time a lot in

advance, Eric