Convexity and Optimization

  • Davidson K
  • Donsig A
N/ACitations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Invexity and Optimization presents results on invex function and their properties in smooth and nonsmooth cases, pseudolinearity and eta-pseudolinearity. Results on optimality and duality for a nonlinear scalar programming problem are presented, second and higher order duality results are given for a nonlinear scalar programming problem, and saddle point results are also presented. Invexity in multiobjective programming problems and Kuhn-Tucker optimality conditions are given for a multiobjecive programming problem, Wolfe and Mond-Weir type dual models are given for a multiobjective programmin. Introduction; Invex Functions (The Smooth Case); .-Pseudolinearity: Invexity and Generalized Monotonicity; Extensions of Invexity to Nondifferentiable Functions; Invexity in Nonlinear Programming; Invex Functions in Multiobjective Programming; Variational and Control Problems Involving Invexity; Invexity for Some Special Functions and Problems.

Cite

CITATION STYLE

APA

Davidson, K. R., & Donsig, A. P. (2009). Convexity and Optimization (pp. 449–504). https://doi.org/10.1007/978-0-387-98098-0_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free