TNC test case output.
swrTNC = fun: 1.0000000630600352
jac: array([0.00663358, 3.06393104])
message: 'Converged (|f_n-f_(n-1)| ~= 0)'
nfev: 113
nit: 21
status: 1
success: True
x: array([218.48593276, 0.61482967])
Process finished with exit code 0
I'm looking for a way to force TNC to seek a solution with the lowest SWR value using the smallest L value possible. Perhaps a weighting factor such as .6 for L and .4 for C totaling 1. A copy of the TNC test case Python program is attached.
I would appreciate any code changes or suggestions that will accomplish the above. Changing optimization methods is an option provided bounds can be applied.
Thanks,
F. Benson, NC4FB