commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Benjamin McCann (JIRA)" <j...@apache.org>
Subject [jira] Commented: (MATH-268) about your java simplex alg, can I input a solution known to be near-optimal (to speed it up)? Can I do so even for the dual simplex?
Date Tue, 02 Jun 2009 20:37:07 GMT

    [ https://issues.apache.org/jira/browse/MATH-268?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12715668#action_12715668
] 

Benjamin McCann commented on MATH-268:
--------------------------------------

For the Simplex method, the Simplex tableau must express a feasible solution the entire time.
 So your near optimal solution would have to be guaranteed to be feasible, which could make
it quite difficult to do.  Do you have some way of guaranteeing this?  This isn't supported
right now (I've never seen a Simplex implementation that does this).  If you were really interested,
you might be able to patch the source so that it builds your own SimplexTableau that starts
at some initial feasible solution that you've specified.

> about your java simplex alg, can I input a solution known to be near-optimal (to speed
it up)?  Can I do so even for the dual simplex?
> --------------------------------------------------------------------------------------------------------------------------------------
>
>                 Key: MATH-268
>                 URL: https://issues.apache.org/jira/browse/MATH-268
>             Project: Commons Math
>          Issue Type: Wish
>         Environment: linux or Windows XP
>            Reporter: william niedringhaus
>


-- 
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.


Mime
View raw message