The Optimal Set and Optimal Partition Approach to Linear and Quadratic Programming
January 1996
Research Paper
This publication is part of collection
| Related Files |
|---|
View PDF Version
(eeb19960111120044.pdf, 0.4MB) |
In this chapter we describe the optimal set approach for sensitivity analysis for LP. We show that optimal partitions and optimal sets remain constant between two consecutive transition-points of the optimal value function. The advantage of using this approach instead of the classical approach (using optimal bases) is shown. Moreover, we present an algorithm to compute the partitions, optimal sets and the optimal value function. This is a new algorithm and uses primal and dual optimal solutions. We also extend some of the results to parametric quadratic programming, and discuss differences and resemblances with the linear programming case.
Keywords
Automatically Extracted Terms
- solution
- interval
- theorem
- partition
- value
- value function
- problem
- function
- transition-point
- proof
- linearity interval
- point
- linearity
- curvy-linearity interval
- algorithm
- approach
- right
- result
- curvy-linearity
- vector
