Continuous programming containing arbitrary norms
S. Chandra, B. D. Craven, Iqbal Husain · Journal of the Australian Mathematical Society Series A Pure Mathematics and Statistics · 1985
Abstract Optimality conditions and duality results are obtained for a class of cone constrained continuous programming problems having terms with arbitrary norms in the objective and constraint functions. The proofs are based on a Fritz John theorem for constrained optimization in abstract spaces. Duality results for a fractional analogue of such continuous programming problems are indicated and a nondifferentiable mathematical programming duality result, not explicitly reported in the literature, is deduced as a special case.