Objective function bounds for the inexact linear programming problem with generalized cost coefficients.
Jonathan F. BardSangit ChatterjeePublished in: Comput. Oper. Res. (1985)
Keyphrases
- linear programming
- objective function
- lower bound
- feasible solution
- linear program
- optimal solution
- upper bound
- sum of squared errors
- optimal cost
- np hard
- cost function
- primal dual
- linear combination
- column generation
- multi objective
- high cost
- reconstruction error
- total cost
- integer programming
- upper and lower bounds
- decision variables
- nonlinear programming
- dynamic programming
- optimization problems
- quasiconvex
- semidefinite programming
- convex functions
- minimum cost
- greedy algorithm
- basis functions
- worst case
- lower and upper bounds
- knapsack problem
- quadratic programming
- expected cost
- feature vectors
- wavelet coefficients
- denoising
- support vector