Now showing items 1-2 of 2
Exactness Conditions for a Convex Differentiable Exterior Penalty for Linear Programming
Sufficient conditions are given for a classical dual exterior penalty function of a linear program to be independent of its penalty parameter. This ensures that an exact solution to the primal linear program can be obtained ...
Nonlinear Knowledge-Based Classification
Prior knowledge over general nonlinear sets is incorporated into nonlinear kernel classification problems as linear constraints in a linear program. The key tool in this incorporation is a theorem of the alternative for ...