Covered solution for a grey linear program based on a general formula for the inverse of a grey matrix.
Qiao-Xing LiSifeng LiuNai-Ang WangPublished in: Grey Syst. Theory Appl. (2014)
Keyphrases
- linear program
- optimal solution
- linear programming
- stochastic programming
- mixed integer
- multistage stochastic
- mixed integer linear program
- approximate dynamic programming
- orthogonal matrices
- simplex method
- lagrange multipliers
- semi infinite
- integer program
- column generation
- linear programming problems
- mixed integer program
- dynamic programming
- special case
- linear relaxation
- primal dual
- mathematical model
- np hard
- set partitioning
- simplex algorithm
- extreme points
- objective function
- low rank
- search space
- quadratic program
- minimum cost
- search algorithm
- mathematical programming
- reinforcement learning