A Characterization of Proper Minimal Points as Solutions of Sublinear Optimization Problems

31Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Proper minimal points are of special interest in multiple objective optimization problems. In this paper, proper minimal points of sets in locally convex spaces and proper minimal solutions of constrained vector problems in topological linear spaces are characterized as solutions of scalar optimization problems. In the latter case no differentiability assumption is made. © 1993 Academic Press, Inc.

References Powered by Scopus

Proper efficiency and the theory of vector maximization

1079Citations
86Readers

This article is free to access.

Proper efficiency with respect to cones

241Citations
12Readers
Get full text
235Citations
5Readers

This article is free to access.

Cited by Powered by Scopus

Degrees of efficiency and degrees of minimality

174Citations
6Readers
Get full text

Optimization of set-valued functions

60Citations
1Readers

This article is free to access.

49Citations
8Readers
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Dauer, J. P., & Saleh, O. A. (1993). A Characterization of Proper Minimal Points as Solutions of Sublinear Optimization Problems. Journal of Mathematical Analysis and Applications, 178(1), 227–246. https://doi.org/10.1006/jmaa.1993.1303

Readers over time

‘15‘16‘17‘18‘21‘2300.511.52

Readers' Seniority

Tooltip

Professor / Associate Prof. 2

40%

PhD / Post grad / Masters / Doc 2

40%

Lecturer / Post doc 1

20%

Readers' Discipline

Tooltip

Mathematics 5

83%

Business, Management and Accounting 1

17%

Save time finding and organizing research with Mendeley

Sign up for free
0