A programming problem with an Lp norm in the objective function
- 1 June 1976
- journal article
- research article
- Published by Cambridge University Press (CUP) in The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
- Vol. 19 (3) , 333-342
- https://doi.org/10.1017/s0334270000001193
Abstract
We consider a programming problem in which the objective function is the sum of a differentiable function and the p norm of Sx, where S is a matrix and p > 1. The constraints are inequality constraints defined by differentiable functions. With the aid of a recent transposition theorem of Schechter we get a duality theorem and also a converse duality theorem for this problem. This result generalizes a result of Mond in which the objective function contains the square root of a positive semi-definite quadratic function.Keywords
This publication has 6 references indexed in Scilit:
- On a constraint qualification in a nondifferentiable programming problemNaval Research Logistics Quarterly, 1976
- A Solvability Theorem for Homogeneous FunctionsSIAM Journal on Mathematical Analysis, 1976
- A class of nondifferentiable mathematical programming problemsJournal of Mathematical Analysis and Applications, 1974
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraintsJournal of Mathematical Analysis and Applications, 1967
- A Gradient Inequality for a Class of Nondifferentiable FunctionsOperations Research, 1966
- Supports of a convex functionBulletin of the American Mathematical Society, 1962