Results 1 to 1 of 1

Thread: Linear Programming and Rank

  1. #1 Linear Programming and Rank 
    Forum Freshman holysword's Avatar
    Join Date
    Apr 2008
    If is bounded and has an interior, prove that the interior of is nonempty and is the unique primal solution.

    The refered "primal solution" is the solution of the primal problem

    I guess that I'm missing something with ranks... can I ensure that has full rank 'cause is bounded and non empty?
    Sorry if its a stupid question, I just don't remember =S

    "Nolite arbitrari quia venerim mittere pacem in terram non veni pacem mittere sed gladium"
    Yeshua Ha Mashiach
    Reply With Quote  


Posting Permissions
  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts