On a constraint qualification in a nondifferentiable programming problem
- 1 December 1976
- journal article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 23 (4) , 611-613
- https://doi.org/10.1002/nav.3800230405
Abstract
A mathematical programming problem with an objective function containing the square root of a positive semidefinite quadratic form has been considered by Mond. In order to use a transposition theorem of Eisenberg, Mond introduces a complicated constraint qualification. In this note we give a simple geometric characterization to this constraint qualification and show that it is implied by the generalized Slater constraint qualification.Keywords
This publication has 3 references indexed in Scilit:
- A class of nondifferentiable mathematical programming problemsJournal of Mathematical Analysis and Applications, 1974
- A Gradient Inequality for a Class of Nondifferentiable FunctionsOperations Research, 1966
- Supports of a convex functionBulletin of the American Mathematical Society, 1962