Mond–Weir duality

B. Mond ()
Additional contact information
B. Mond: La Trobe University

Chapter Chapter 8 in Optimization, 2009, pp 157-165 from Springer

Abstract: Abstract Consider the nonlinear programming problem to minimize $$f(x)$$ subject to $$g(x) \leq 0$$ . The initial dual to this problem given by Wolfe required that all the functions be convex. Since that time there have been many extensions that allowed the weakening of the convexity conditions. These generalizations include pseudo- and quasi-convexity, invexity, and second order convexity. Another approach is that of Mond and Weir who modified the dual problem so as to weaken the convexity requirements. Here we summarize and compare some of these different approaches. It will also be pointed out how the two different dual problems (those of Wolfe and Mond–Weir) can be combined. Some applications, particularly to fractional programming, will be discussed.

Keywords: Mond–Weir dual; linear programming; Wolfe dual (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-0-387-98096-6_8

Ordering information: This item can be ordered from
http://www.springer.com/9780387980966

DOI: 10.1007/978-0-387-98096-6_8

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().