Optimisation problem: Find the best N pts (x,y) to meet criteria?
- June 12, 2020
- 2 replies
- 3937 views
to all,
A bit of an open question as I do not know how to go about solving the following – if it can be done at all
I have a curve C1, define between [x1,xn] and I would like to create a curve C2 using N pts so that some criteria are met. Essentially is a “double optimisation” problem. Consider the following; I want C2 to be made of p points p(xi,yi) – Generally a few points (say no more than 10)
Criteria 1:- xn > xn-1 > x1 . xn and x1 are given
Criteria 2: In a given x range [xn,x+1] rms C1 ~ rms C2 . Within a given a tolerance (say +/-1%).
Is there of way of using Mathcad to find the best pair of points to meet criteria #2
Does it require some sort of loop, or is there some built-in optimisation tool one can use
Attached a mcad 15 file swith some preliminary stuff - Not much

