Skip to main content
Article thumbnail
Location of Repository

Duality in non-convex problems of optimization

By Gasymov Rafail Naib ogly

Abstract

Non-comvex extremal problems of the scalar and vector optimization are investigated in the paper aiming at the establishment of dual relationships for non-convex extremal problems of the scalar and vector optimization. As a result the new determination of a subdifferential has been introduced, sufficient conditions of subdifferentiability for non-convex functions and multiply mappings have been obtained, the separability theorem for non-convex sets has been proved as well as duality theorems for non-convex problems of the scalar and vector optimizationAvailable from VNTIC / VNTIC - Scientific & Technical Information Centre of RussiaSIGLERURussian Federatio

Topics: 12B - Statistics, operations research, MATHEMATICS
Year: 1992
OAI identifier:
Provided by: OpenGrey Repository
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/10068/35... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.