Implied constraints and LP duals of general nonlinear programming problems

✍ Scribed by Pravin K. Johri

• Book ID: 104339638
• Publisher: Elsevier Science
• Year: 1999
• Tongue: English
• Weight: 118 KB
• Volume: 112
• Category: Article
• ISSN: 0377-2217
• DOI: 10.1016/s0377-2217(97)00403-7

✦ Synopsis

A very surprising result is derived in this paper, that there exists a family of LP duals for general NLP problems. A general dual problem is ®rst derived from implied constraints via a simple bounding technique. It is shown that the Lagrangian dual is a special case of this general dual and that other special cases turn out to be LP problems. The LP duals provide a very powerful computational device but are derived using fairly strict conditions. Hence, they can often be infeasible even if the primal NLP problem is feasible and bounded. Many directions for relaxing these conditions are outlined for future research. A concept of local duality is also introduced for the ®rst time akin to the concept of local optimality.