Boundedness and nonemptiness of the efficient solution sets in multiobjective optimization
From MaRDI portal
(Redirected from Publication:848729)
The author studies the recession properties of sets containing the efficient or properly efficient solutions for a class of finite dimensional multiobjective optimization problems. Under appropriate hypotheses, it is shown the equivalence between the boundedness and nonemptiness of the sets of efficient solutions and that of properly efficient solutions sets. The research work is completed with some new necessary conditions for the nonemptiness of the efficient solutions sets in terms of the associated recession cones and functions.
Recommendations
- Non-emptiness and boundedness of efficient solution set in constrained convex vector optimization
- Publication:4205245
- Existence and boundedness of solutions in infinite-dimensional vector optimization problems
- An upper bound on properly efficient solutions in multiobjective optimization
- scientific article; zbMATH DE number 4164571
Cites work
- An improved definition of proper efficiency for vector maximization with respect to cones
- Characterization of the nonemptiness and compactness of solution sets in convex and nonconvex vector optimization
- Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
- Characterizations of the nonemptiness and Boundedness of weakly efficient solution sets of Convex vector optimization problems in real reflexive Banach spaces
- Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
- Coercivity properties and well-posedness in vector optimization
- Convex composite multi-objective nonsmooth programming
- Existence theory for finite-dimensional pseudomonotone equilibrium problems
- Multicriteria optimization in engineering and in the sciences
- On efficient solutions in vector optimization
- Proper efficiency and the theory of vector maximization
- Theory of multiobjective optimization
- Variational Analysis
- Vector equilibrium problems under asymptotic analysis
Cited in
(23)- Optimality conditions for vector equilibrium problems with applications
- A scalarization scheme for binary relations with applications to set-valued and robust optimization
- Existence of Pareto solutions for vector polynomial optimization problems with constraints
- Existence of efficient and properly efficient solutions to problems of constrained vector optimization
- Variational convergence for vector-valued functions and its applications to convex multiobjective optimization
- Properties of efficient solution sets under addition of objectives
- An upper bound on properly efficient solutions in multiobjective optimization
- Asymptotic analysis of scalarization functions and applications
- scientific article; zbMATH DE number 4164571 (Why is no real title available?)
- scientific article; zbMATH DE number 519793 (Why is no real title available?)
- Existence and boundedness of solutions in infinite-dimensional vector optimization problems
- Nonemptiness and boundedness of solution sets for vector variational inequalities via topological method
- Recession function and its applications in optimization
- Efficiency in quasiconvex multiobjective nondifferentiable optimization on the real line
- The q-asymptotic function in c-convex analysis
- Boundedness and nonemptiness of solution sets for set-valued vector equilibrium problems with an application
- Vector optimization problems via improvement sets
- A subgradient projection method for quasiconvex multiobjetive optimization
- Second-order asymptotic analysis for noncoercive convex optimization
- Inner and outer estimates for the solution sets and their asymptotic cones in vector optimization
- Optimality and stability conditions for Benson efficient solutions in vector optimization problems
- Existence of weak Pareto efficient solutions of a multiobjective optimization problem under a closed constraint set
- On Hadamard well-posedness of families of Pareto optimization problems
This page was built for publication: Boundedness and nonemptiness of the efficient solution sets in multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848729)
