https://doi.org/10.2307/2582400 • https://www.jstor.org/stable/2582400 Copy URL This paper offers a new approach to the solution of zero-one goal-programming ...
The next step is sending that list onto an order processing algorithm that goes out and buys or sells the stocks that have been selected. The code may seem hard to follow, but it’s one of the oldest ...
This note presents proofs of convergence of nonlinear programming algorithms under a weaker requirement than Zangwill's convergence theorems A and C. The objective is the removal of the closedness and ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback