Generalized Convexity and Vector Optimization

Shashi K. Mishra

ISBN 10: 3642099300 / ISBN 13: 9783642099304

Published by Springer Berlin Heidelberg Nov 2010, 2010

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -The present lecture note is dedicated to the study of the optimality conditions and the duality results for nonlinear vector optimization problems, in nite and in nite dimensions. The problems include are nonlinear vector optimization problems, s- metric dual problems, continuous-time vector optimization problems, relationships between vector optimization and variational inequality problems. Nonlinear vector optimization problems arise in several contexts such as in the building and interpretation of economic models; the study of various technolo- cal processes; the development of optimal choices in nance; management science; production processes; transportation problems and statistical decisions, etc. In preparing this lecture note a special effort has been made to obtain a se- contained treatment of the subjects; so we hope that this may be a suitable source for a beginner in this fast growing area of research, a semester graduate course in nonlinear programing, and a good reference book. This book may be useful to theoretical economists, engineers, and applied researchers involved in this area of active research. The lecture note is divided into eight chapters: Chapter 1 brie y deals with the notion of nonlinear programing problems with basic notations and preliminaries. Chapter 2 deals with various concepts of convex sets, convex functions, invex set, invex functions, quasiinvex functions, pseudoinvex functions, type I and generalized type I functions, V-invex functions, and univex functions. 304 pp. Englisch.

Seller Inventory # 9783642099304

Bibliographic Details

• Title: Generalized Convexity and Vector Optimization
• Publisher: Springer Berlin Heidelberg Nov 2010
• Publication Date: 2010
• Language: English
• ISBN 10: 3642099300
• ISBN 13: 9783642099304
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 17D millimeters 235 millimeters width by 155 millimeters height by 17 millimeters depth
• Weight: 464 grams

About this title

Synopsis

The present lecture note is dedicated to the study of the optimality conditions and the duality results for nonlinear vector optimization problems, in ?nite and in?nite dimensions. The problems include are nonlinear vector optimization problems, s- metric dual problems, continuous-time vector optimization problems, relationships between vector optimization and variational inequality problems. Nonlinear vector optimization problems arise in several contexts such as in the building and interpretation of economic models; the study of various technolo- cal processes; the development of optimal choices in ?nance; management science; production processes; transportation problems and statistical decisions, etc. In preparing this lecture note a special effort has been made to obtain a se- contained treatment of the subjects; so we hope that this may be a suitable source for a beginner in this fast growing area of research, a semester graduate course in nonlinear programing, and a good reference book. This book may be useful to theoretical economists, engineers, and applied researchers involved in this area of active research. The lecture note is divided into eight chapters: Chapter 1 brie?y deals with the notion of nonlinear programing problems with basic notations and preliminaries. Chapter 2 deals with various concepts of convex sets, convex functions, invex set, invex functions, quasiinvex functions, pseudoinvex functions, type I and generalized type I functions, V-invex functions, and univex functions.

From the Back Cover

The present book discusses the Kuhn-Tucker Optimality, Karush-Kuhn-Tucker Necessary and Sufficient Optimality Conditions in presence of various types of generalized convexity assumptions. Wolfe-type Duality, Mond-Weir type Duality, Mixed type Duality for Multiobjective optimization problems such as Nonlinear programming problems, Fractional programming problems, Nonsmooth programming problems, Nondifferentiable programming problems, Variational and Control problems under various types of generalized convexity assumptions.