Existence of Solutions in Vector Optimization Problems

Authors:
I. V. Sergienko;T. T. Lebedeva;N. V. Semenova
Affiliations:
Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine;Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine;Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2000

Citing 0
Cited 6

Stability of Discrete Vector Problems with the Parametric Principle of Optimality

Cybernetics and Systems Analysis
A Vector Problem of Optimal Control in a Hilbert Space

Cybernetics and Systems Analysis
An approach to solving discrete vector optimization problems over a combinatorial set of permutations

Cybernetics and Systems Analysis
Attainability of optimal solutions to a linear problem of multicriterion optimization with respect to the weighed sum of variously important and transitively subordinated criteria

Cybernetics and Systems Analysis
Combinatorial optimization under uncertainty

Cybernetics and Systems Analysis
A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Conditions for the existence of various effective solutions of vector optimization problems with an unbounded convex closed feasible set of solutions are established. The study is based on the use of the properties of recession cones of sets of feasible solutions and cones of perspective directions of optimization problems.