[
https://issues.apache.org/jira/browse/MATH-268?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12712600#action_12712600
]
Luc Maisonobe commented on MATH-268:
------------------------------------
If you are thinking about the Nelder-Mead or the Torczon's simplex optimizers,
yes you can since there is a start point parameter.
If you are thinking about the Dantzig's simplex for linear models, no you can't
since the implementation builds internally the initial feasible solution (if
one exists) and then optimizes it.
> 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.
