A dual simplex method for grey linear programming problems based on duality results.
Davood Darvishi SalookolaeiSeyed Hadi NasseriPublished in: Grey Syst. Theory Appl. (2020)
Keyphrases
- simplex method
- linear programming problems
- linear programming
- primal dual
- linear program
- linear fractional
- simplex algorithm
- semidefinite programming
- interior point methods
- column generation
- feasible solution
- dynamic programming
- optimal solution
- convex optimization
- integer programming
- approximation algorithms
- convergence rate
- np hard
- objective function
- quadratic programming
- least squares
- state space
- feature space