Mathematics of Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


MATHEMATICS OF OPERATIONS RESEARCH
Vol. 11, No. 1, February 1986, pp. 30-35
DOI: 10.1287/moor.11.1.30
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Pappalardo, M.
Right arrow Search for Related Content

On the Duality Gap in Nonconvex Optimization

M. Pappalardo

Department of Mathematics, University of Pisa, Via Buonarroti 2, 56100 Pisa, Italy

Given a nonconvex constrained minimization problem, we introduce the dual problem by means of the ordinary Lagrangean function. The aim of the paper is to give, by means of the "image problem," an estimate of the duality gap using the definition of lack of convexity of a function.

Key Words: nonconvex optimization; duality; duality gap; Lagrangean function; image problem; lack of convexity






HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 1986 by INFORMS.