On solving a D.C. programming problem by a sequence of linear programs.
Reiner HorstThai Quynh PhongNguyen V. ThoaiJakob de VriesPublished in: J. Glob. Optim. (1991)
Keyphrases
- linear program
- simplex method
- linear programming problems
- linear programming
- integer program
- quadratic program
- semi infinite
- mixed integer program
- column generation
- optimal solution
- primal dual
- mixed integer linear program
- lp relaxation
- simplex algorithm
- interior point methods
- stochastic programming
- objective function
- dynamic programming
- nonlinear programming
- mixed integer
- extreme points
- linear inequalities
- quadratic programming
- market equilibrium
- np hard
- markov decision problems
- nelder mead
- solving problems
- cutting plane
- interior point
- genetic algorithm
- computational complexity
- convex optimization
- convex functions