AbstractEssential properties of multiobjective programming in real normed linear spaces are studied. Necessary and sufficient conditions for nondominated solutions under regularity and Fréchet differentiability assumptions are developed
A convex programming problem in a conic form is a minimization of a linear function $\langle c, x\ra...
AbstractIn this study we present an important theorem of the alternative involving convex functions ...
Consequences of a general formulation of the theorem of the alternative are exploited
AbstractEssential properties of multiobjective programming in real normed linear spaces are studied....
AbstractDuality relationships in finding a best approximation from a nonconvex cone in a normed line...
We consider the problem of finding the set of proper minimal (proper efficient, proper Pareto optima...
AbstractIn this article we give a new criterion for the existence of a bounded base for a cone P of ...
summary:In the paper a necessary condition is given for the existence of a minimal point of once con...
AbstractIn this paper necessary conditions and sufficient conditions are obtained for efficient solu...
AbstractThis paper is concerned with nonlinear optimization problems in normed linear spaces. Necess...
AbstractThis paper proposes and compares several ways of measuring the degree of normality of a conv...
We characterize the inconsistency of certain nonlinear systems under mild convexity requirements and...
A nonlinear theorem of the alternative is proposed which needs no regularity assumption. Several equ...
In optimization theory the tangent cone and the contingent cone are used to classify the regularity ...
During the last few decades, multiobjective programming has received much attention for both its num...
A convex programming problem in a conic form is a minimization of a linear function $\langle c, x\ra...
AbstractIn this study we present an important theorem of the alternative involving convex functions ...
Consequences of a general formulation of the theorem of the alternative are exploited
AbstractEssential properties of multiobjective programming in real normed linear spaces are studied....
AbstractDuality relationships in finding a best approximation from a nonconvex cone in a normed line...
We consider the problem of finding the set of proper minimal (proper efficient, proper Pareto optima...
AbstractIn this article we give a new criterion for the existence of a bounded base for a cone P of ...
summary:In the paper a necessary condition is given for the existence of a minimal point of once con...
AbstractIn this paper necessary conditions and sufficient conditions are obtained for efficient solu...
AbstractThis paper is concerned with nonlinear optimization problems in normed linear spaces. Necess...
AbstractThis paper proposes and compares several ways of measuring the degree of normality of a conv...
We characterize the inconsistency of certain nonlinear systems under mild convexity requirements and...
A nonlinear theorem of the alternative is proposed which needs no regularity assumption. Several equ...
In optimization theory the tangent cone and the contingent cone are used to classify the regularity ...
During the last few decades, multiobjective programming has received much attention for both its num...
A convex programming problem in a conic form is a minimization of a linear function $\langle c, x\ra...
AbstractIn this study we present an important theorem of the alternative involving convex functions ...
Consequences of a general formulation of the theorem of the alternative are exploited
DOI
Add to ORKG