Profiles
Research Units
Publications
Sign Up
Faculty Login
X
Articles
On convex vector optimisation
Joydeep Dutta
Published in Australian Mathematical Publishing Association
2000
DOI:
10.1017/s0004972700022036
Volume: 61
Issue: 1
Pages: 85 - 88
Abstract
In this article we present a simple method to deduce necessary conditions for weak minimisation of a convex vector program in a Banach space. Our main tool here will be the generalised Jabcobian of Ralph.
Download
PDF
Postprint
Cite
Postprint Version
Content may be subject to copyright,
Check License
Originally Published at 10.1017/s0004972700022036
Originally Published at 10.1017/s0004972700022036
PDF
Journal Details
Authors (1)
About the journal
Journal
Bulletin of the Australian Mathematical Society
Publisher
Australian Mathematical Publishing Association
ISSN
00049727
Authors (1)
Joydeep Dutta
School of Artificial Intelligence and Data Science (AIDE)
IIT Jodhpur
Recent publications
Solving dual problems using a coevolutionary optimization algorithm
A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
Inexact proximal point methods for variational inequality problems
Monotonic analysis over cones: III
Get all the updates for this publication
Follow