Network Design Optimization for Fiber Optic Revenue Maximization

The patent segments the complex PCSPG optimization problem into manageable components by formulating it as a mixed-integer linear program with specific objective functions and constraints. The network design problem is divided into discrete decision variables (whether to build each link) that can be optimized systematically, transforming an intractable complex problem into a structured optimization model that can be solved with appropriate algorithms.

The patent changes the approach from traditional heuristic methods to a mathematical optimization framework with defined objective functions and constraints. By parameterizing the problem with revenue parameters (pi), cost parameters (cij), and profit parameters (di), the solution transforms qualitative design decisions into quantitative optimization that can be solved systematically to achieve profit maximization.

The patent applies preliminary action by performing Lagrangian relaxation on selected constraints before solving the full optimization problem. This preliminary step transforms the complex constrained optimization into a simpler form that can be solved more efficiently, obtaining good approximate solutions without requiring exhaustive computation of all possible network configurations.

The patent implements partial action by using heuristics that explore only a subset of the complete solution space. Rather than exhaustively evaluating all possible network designs, the optimization algorithm focuses on promising regions of the solution space, achieving satisfactory profit maximization with reduced computational resource consumption.