Today we formulate the problem with deterministic but time dependent patterns as a linear programming problem for a selected time scale. For simplifications, we assume: the size of DPG is continuous; there is no energy losses; issues of reliability, dynamic stability and power quality is left out.
We consider the relationship between net generation of DPG at each node and currents between nodes a linear mapping, which can be found by exiting loadflow analysis techniques. Since the net generation of DPG is a function of sizes (which can be 0 if no DPG) for different type DPGs and consumption, we can express both the objective function and the constraints in terms of sizes, which are linear. Therefore, we can solve this optimization problem as a LP.
We decide to solve the problem using the stochastic approach tomorrow.
Subscribe to:
Post Comments (Atom)
More recently Mayer (2002), who offers a similar model to Polya's in his "componential theory of problem solving", considers similar "elements". Much of the problem solving literature either develops of reiterates these basic "elements" and guidance in tackling mathematical problems. how to master math
ReplyDelete