We describe an algorithm, based on the simplex method of linear programming, for solving the discrete l 1 approximation problem with any type of linear constraints. The numerical results reported here ...
Abstract: An inner approximation algorithm is proposed for path-constrained dynamic optimization (PCDO) by iteratively solving restrictions of PCDO (RPCDO). Firstly, an upper bound function of the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback