An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution.
Robert M. FreundPublished in: Ann. Oper. Res. (1996)
Keyphrases
- starting point
- algorithm for linear programming
- optimal solution
- affine scaling
- initial solution
- linear programming
- search space
- distance measure
- starting points
- primal dual
- metaheuristic
- objective function
- computational complexity
- feasible solution
- similarity measure
- worst case
- space complexity
- image processing
- np hard
- global optimum
- distance metric
- distance function
- multiresolution
- neural network
- nearest neighbor
- computational cost
- dynamic programming