scientific article
From MaRDI portal
Publication:3701188
zbMath0578.90048MaRDI QIDQ3701188
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
vector optimizationoptimality conditionsefficient solutionsduality resultsvector approximationleast elementsmaximum principle for cooperative n-person differential gamespartially ordered linear vector spaces
Sensitivity, stability, parametric optimization (90C31) Cooperative games (91A12) Differential games (aspects of game theory) (91A23) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Ordered topological linear spaces, vector lattices (46A40)
Related Items (only showing first 100 items - show all)
A characterization of quasiconvex vector-valued functions ⋮ Necessary conditions for extremality and separation theorems with applications to multiobjective optimization ⋮ \(\varepsilon k^ 0\)-subdifferentials of convex functions ⋮ Solving multiobjective optimisation problems using genetic algorithms and solutions concepts of cooperative games ⋮ On the existence of maximal elements for partial preorders ⋮ On inexact projected gradient methods for solving variable vector optimization problems ⋮ A steepest descent-like method for vector optimization problems with variable domination structure ⋮ Nonvertical Affine Manifolds and Separation Theorems in Product Spaces ⋮ A generalized section theorem and a minimax inequality for a vector-valued mapping1 ⋮ Inexact projected gradient method for vector optimization ⋮ A systematization of convexity and quasiconvexity concepts for set-valued maps, defined byl-type andu-type preorder relations ⋮ Minimization of Gerstewitz functionals extending a scalarization by Pascoletti and Serafini ⋮ GENERALIZED CONTINGENT EPIDERIVATIVES IN SET-VALUED OPTIMIZATION: OPTIMALITY CONDITIONS ⋮ Invex optimisation problems ⋮ Recession cones and the domination property in vector optimization ⋮ Unnamed Item ⋮ Invex-convexlike functions and duality ⋮ Complete efficiency and interdependencies between objective functions in vector optimization ⋮ An analysis of some dual problems in multiobjective optimization (I) ⋮ Kolmogorov conditions for vectorial optimization problems ⋮ Super Efficiency in Vector Optimization ⋮ Characterisations of efficient sets in vector optimisation ⋮ A note on connectivity of efficient solution sets ⋮ Continuity of approximate solution maps to vector equilibrium problems ⋮ Optimality conditions and duality on approximate solutions in vector optimization with arcwise connectivity ⋮ Gerstewitz functionals on linear spaces and functionals with uniform sublevel sets ⋮ Multicriteria optimization in antenna design ⋮ Connectedness of approximate efficient solutions for generalized semi-infinite vector optimization problems ⋮ Axiomatic approach to duality in optimization ⋮ Well-posedness for bilevel vector equilibrium problems with variable domination structures ⋮ ∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS ⋮ Necessary conditions for efficient solution of vector optimization problems ⋮ Connectedness of the efficient solution set of a convex vector optimization in normed spaces ⋮ Optimality conditions for multiobjecttve and nonsmooth minimisation in abstract spaces ⋮ Generalized strong vector quasi-equilibrium problem with domination structure ⋮ A generalization of ekellandz’s variational principle ⋮ Connectivity of efficient solution sets in vector optimization of set-valued mappings ⋮ Strong vector equilibrium problems ⋮ An extremal vector problem under inclusion constraints via radial epi-derivatives ⋮ Optimality conditions and scalarization of approximate quasi weak efficient solutions for vector equilibrium problem ⋮ On the density of proper efficient points ⋮ Vector subdifferentials via recession mappings∗∗this research was supported by grants from M.U.R.S.T (Itall) and the australian research council.$ef: ⋮ Continuous-time multiobjective fractional programming ⋮ Efficiency Criteria and Duality Models for Multiobjective Fractional Programming Problems Containing Locall'y Subdifferentiable and ρ-Convex Functions ⋮ ∊-Variational inequalities in partially ordered spaces ⋮ Some new classes of generalized concave vector-valued functions ⋮ A general iterative algorithm for vector equilibrium problem ⋮ Solving the Pareto front for multiobjective Markov chains using the minimum Euclidean distance gradient-based optimization method ⋮ On the characterization of efficient points by means of monotone functionals ⋮ On Hölder continuity of approximate solution maps to vector equilibrium problems ⋮ Explicitly quasiconvex set-valued optimization ⋮ A set scalarization function based on the oriented distance and relations with other set scalarizations ⋮ Traffic assignment: methods and simulations for an alternative formulation of the fixed demand problem ⋮ Game-theoretic approach to the optimization of FDDI computer networks ⋮ e-weak minimal solutions of vector optimization problems with set-valued maps ⋮ Proper efficiency and duality for a class of multiobjective fractional variational problems containing arbitrary norms ⋮ On the existence of efficient points ⋮ General duality in vector optimization ⋮ Efficiency and Henig efficiency for vector equilibrium problems. ⋮ New type of generalized vector quasiequilibrium problem ⋮ On the super efficiency in locally convex spaces ⋮ Necessary optimality conditions in nondifferentiable vector optimization ⋮ Unnamed Item ⋮ Lagrangian duality for multiobjective programming problems in lexicographic order ⋮ Stampacchia generalized vector quasi-equilibrium problem with set-valued mapping ⋮ ε–Optimality to approximation in partially ordered spaces ⋮ εVariational inequalities for vector approximation problems ⋮ Characterizations of solution sets of convex vector minimization problems ⋮ Scalarizations and optimality of constrained set-valued optimization using improvement sets and image space analysis ⋮ On the contractibility and connectedness of an efficient point set. ⋮ Some Calculus Rules for Contingent Epiderivatives ⋮ A Characterization of Approximate Solutions of Multiobjective Stochastic Optimal Control Problems ⋮ Sensitivity analysis using the tangent derivative ⋮ Continuity of the efficient solution mapping for vector optimization problems ⋮ On necessary and sufficient optimality conditions for multicriterial optimization problems ⋮ Generalization and sharpening of some duality relations for a class of vector optimization problems ⋮ Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization ⋮ A notion of local proper efficiency in the Borwein sense in vector optimisation ⋮ Generalized strong vector quasi-equilibrium problems with variable ordering structure ⋮ The connectedness of the solutions set for set-valued vector equilibrium problems under improvement sets ⋮ The Attainment of the Solution of the Dual Program in Vertices for Vectorial Linear Programs ⋮ On the connections between semidefinite optimization and vector optimization ⋮ A multiplier rule in set-valued optimisation ⋮ On the Intrinsic Core of Convex Cones in Real Linear Spaces ⋮ Proper efficiency and duality for a class of constrained multiobjective fractional optimal control problems containing arbitrary norms ⋮ Lagrange multipliers for set-valued optimization problems associated with coderivatives ⋮ On directional derivatives for cone-convex functions ⋮ The geometric vector inequality and its properties ⋮ The geometric vector inequality and its properties ⋮ A note on lower semicontinuity of minimal points ⋮ Kolmogorov-conditions for vectorial approximation problems ⋮ Duality and saddle-points for convex-like vector optimization problems on real linear spaces ⋮ Parametric approximation problems arising in vector optimization ⋮ Characterizations of some remarkable classes of cones ⋮ Continuity of minimal points with applications to parametric multiple objective optimization ⋮ Existence and continuity of solutions for vector optimization ⋮ A general cone decomposition theory based on efficiency ⋮ Duality in disjunctive programming via vector optimization ⋮ On the notion of proper efficiency in vector optimization ⋮ Connectedness of efficient solution sets for set-valued maps in normed spaces
This page was built for publication:
