Optimality and duality in multiobjective programming involving higher order semilocally strong convexity

Anurag Jayswal, Vivek Singh*, I. Ahmad

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

In this paper, we propose a generalisation of convexity, namely higher order semilocally strong convexity for a nonlinear multiobjective programming problem, where the function involved are semidifferentiable. The generalised Karush-Kuhn-Tucker necessary and sufficient optimality conditions are derived. Moreover, a general Mond-Weir type dual problem is presented for nonlinear multiobjective programming problem involving higher order semilocally strong convexity and usual duality theorems are discussed.

Original languageEnglish
Pages (from-to)204-218
Number of pages15
JournalInternational Journal of Mathematics in Operational Research
Volume11
Issue number2
DOIs
StatePublished - 2017

Bibliographical note

Publisher Copyright:
Copyright © 2017 Inderscience Enterprises Ltd.

Keywords

  • Duality
  • Multiobjective programming
  • Optimality conditions
  • Semilocally strongly convex
  • Strict minimiser of order m

ASJC Scopus subject areas

  • Decision Sciences (all)
  • Modeling and Simulation

Fingerprint

Dive into the research topics of 'Optimality and duality in multiobjective programming involving higher order semilocally strong convexity'. Together they form a unique fingerprint.

Cite this