253. Sequential Trajectory Method for Solving Location Problems
Invited abstract in session MB-48: Advances in Location Analysis, stream Locational Analysis.
Monday, 10:30-12:00Room: Parkinson B09
Authors (first author is the speaker)
| 1. | Malgorzata Miklas-Kalczynska
|
| Information Systems and Decision Sciences, California State University, Fullerton |
Abstract
We further develop the trajectory method for solving unconstrained non-linear optimization problems with differentiable objective functions. A parameter is introduced into the optimization problem in such a manner that the value of the objective is easy to find for its initial value. A trajectory connects the obtained solution to the desired solution. We trace the trajectory, and the solution to the optimization problem is at the end of the trajectory. This new solution then serves as the initial solution for an extension of the original problem, creating a sequence. This procedure results in optimal solutions to convex problems and can be used to obtain starting solutions to nonconvex problems. The idea is illustrated with examples from location analysis.
Keywords
- Location
- Continuous Optimization
- Optimization Modeling
Status: accepted
Back to the list of papers