Optimality conditions in optimization problems with convex feasible set using convexificators
- 12 April 2017
- journal article
- research article
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 86 (1) , 103-121
Abstract
No abstract availableKeywords
Funding Information
- Institute for Research in Fundamental Sciences (95260124)
This publication has 30 references indexed in Scilit:
- RISK MEASURES: RATIONALITY AND DIVERSIFICATIONMathematical Finance, 2010
- Infinite (semi-infinite) problems to characterize the optimality of nonlinear optimization problemsEuropean Journal of Operational Research, 2008
- Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problemsOptimization, 2006
- Continuous generalized convex functions and their characterizationsOptimization, 2005
- Convexifactors, generalized convexity and vector optimizationOptimization, 2004
- Characterization of solution sets of convex programsOperations Research Letters, 1991
- A simple characterization of solution sets of convex programsOperations Research Letters, 1988
- Discontinuous optimization in batch production using SUMTInternational Journal of Production Research, 1984
- Fractional programming: Applications and algorithmsEuropean Journal of Operational Research, 1981
- A switching regression method using inequality conditionsJournal of Econometrics, 1979