Proper Efficient Points for Maximizations with Respect to Cones
From MaRDI portal
Publication:4146574
DOI10.1137/0315004zbMath0369.90096OpenAlexW2083818478MaRDI QIDQ4146574
Publication date: 1977
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1959.13/940503
Convex programming (90C25) Nonlinear programming (90C30) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items
A survey of vector optimization in infinite-dimensional spaces. II, Necessary conditions of nondominated solutions in multicriteria decision making, Major-efficient solutions and weakly major-efficient solutions of multiobjective programming, On the notion of proper efficiency in vector optimization, Strongly proper efficient solutions: efficient solutions with bounded trade-offs, Sensitivity analysis in multiobjective optimization, A combined scalarizing method for multiobjective programming problems, Weighting factor results in vector optimization, Characterizing the nondominated set by separable functions, The domination property in multicriteria optimization, Some hybrid fixed point theorems related to optimization, Robustness in nonsmooth nonlinear multi-objective programming, Quadratic scalarization for decomposed multiobjective optimization, Density theorems for generalized Henig proper efficiency, Families of differentiable scalarization functions, Characterizations via linear scalarization of minimal and properly minimal elements, Strong duality for infinite-dimensional vector-valued programming problems, Tradeoff directions in multiobjective optimization problems, Proper efficiency in locally convex topological vector spaces, Geoffrion type characterization of higher-order properly efficient points in vector optimization, Strict efficiency in vector optimization with nearly convexlike set-valued maps, A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems, The domination property for efficiency in locally convex spaces, Lagrangian duality for minimization of nonconvex multifunctions, Optimality conditions for approximate solutions in multiobjective optimization problems, An improved definition of proper efficiency for vector maximization with respect to cones, On the properly efficient points of nonconvex sets, On weak and strong Kuhn-Tucker conditions for smooth multiobjective optimization, On the transformation of lexicographic nonlinear multiobjective programs to single objective programs, Necessary conditions for efficient solution of vector optimization problems, On approximating weakly/properly efficient solutions in multi-objective programming, Chain rules for a proper \(\varepsilon\)-subdifferential of vector mappings, Generalized minimax inequalities for set-valued mappings, Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps, On the generalized Fritz John optimality conditions of vector optimization with set-valued maps under Benson proper efficiency, \(\varepsilon\)-strict subdifferentials of set-valued maps and optimality conditions, Duality for nonlinear multiple-criteria optimization problems, Lexocographic multipliers, Proper efficiency with respect to cones, Nonconvex vector optimization of set-valued mappings., Super efficiency of multicriterion network equilibrium model and vector variational inequality, Higher-order cone-pseudoconvex, quasiconvex and other related functions in vector optimization, On proper and improper efficient solutions of optimal problems with multicriteria, Admissible points of a convex polyhedron, Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior, Duality theory for maximizations with respect to cones, Properly efficient and efficient solutions for vector maximization problems in Euclidean space, On a domination property for vector maximization with respect to cones, Superefficiency in vector optimization with nearly subconvexlike set-valued maps, A review of multiobjective programming and its application in quantitative psychology, On Pareto optima, the Fermat-Weber problem, and polyhedral gauges, Optimality conditions in nonconical multiple objective programming, Scalarization of \(\epsilon\)-super efficient solutions of set-valued optimization problems in real ordered linear spaces, Characterization of properly efficient solutions by generalized scalarization methods, Second-order optimality conditions for set-valued optimization problems under Benson proper efficiency, Hartley proper efficiency in multifunction optimization, Properly optimal elements in vector optimization with variable ordering structures, Lagrange multiplier theorem of multiobjective programming problems with set functions, Proper efficiency in nonconvex vector-maximization-problems, Proper efficiency and proper Karush-Kuhn-Tucker conditions for smooth multiobjective optimization problems, Coradiant-valued maps and approximate solutions in variable ordering structures, On the effects of combining objectives in multi-objective optimization, Linear and conic scalarizations for obtaining properly efficient solutions in multiobjective optimization, On Benson's scalarization in multiobjective optimization, Variable preference modeling with ideal-symmetric convex cones, Higher-order duality in vector optimization over cones, Inner and outer estimates for the solution sets and their asymptotic cones in vector optimization, Optimality conditions of vector set-valued optimization problem involving relative interior, Proper efficiency in vector optimization on real linear spaces., A solution concept for fuzzy multiobjective programming problems based on convex cones., Pareto optimization in topological vector spaces, Stability of properly efficient points and isolated minimizers of constrained vector optimization problems, Characterizations of efficient and weakly efficient points in nonconvex vector optimization, Local completeness and Pareto optimization, Geoffrion's proper efficiency in linear fractional vector optimization with unbounded constraint sets, Value functions, domination cones and proper efficiency in multicriteria optimization, Hartley properly and super nondominated solutions in vector optimization with a variable ordering structure, The structure of admissible points with respect to cone dominance, Multicriteria fractional programming -- an approach by means of conjugate functions, Properly efficient solutions for vectorial norm approximation, \(\epsilon \)-Henig proper efficiency of set-valued optimization problems in real ordered linear spaces, Improved \(\varepsilon\)-constraint method for multiobjective programming, Solutions of fuzzy multiobjective programming problems based on the concept of scalarization, A minimax inequality for vector-valued mappings, Characterizations of the Benson proper efficiency for nonconvex vector optimization, Benson proper efficiency in the vector optimization of set-valued maps, Decision making under uncertainty: A semi-infinite programming approach, Super efficient solutions and super infima in vector optimization, Concepts of proper efficiency, Efficiency and proper efficiency in vector maximization with respect to cones, On optimality conditions for maximizations with respect to cones, Duality theory for infinite-dimensional multiobjective linear programming, Super efficiency in vector optimization with nearly convexlike set-valued maps., Some characterizations of the optimal solutions of a vector optimization problem, Existence theorems in vector optimization, On efficient sets in vector maximum problems - A brief survey, Bases of convex cones and Borwein's proper efficiency, Near-subconvexlikeness in vector optimization with set-valued functions, Proper solutions of vector optimization problems, Optimal consumption portfolio and no-arbitrage with nonproportional transaction costs, Proper efficiency in linear fractional vector optimization via Benson's characterization, Duality in vector optimization, Proper minimal points of nonconvex sets in Banach spaces in terms of the limiting normal cone, Robust optimization revisited via robust vector Farkas lemmas, Density and connectedness of optimal points with respect to improvement sets, Necessary conditions for extremality and separation theorems with applications to multiobjective optimization, Global efficiency in multiobjective programming*, Vector optimization w.r.t. relatively solid convex cones in real linear spaces, On duality in the vectorial control-approximation problem, Existence results for strong vector equilibrium problems and their applications, A New Characterization of Cone Proper Efficient Points, GENERALIZED CONTINGENT EPIDERIVATIVES IN SET-VALUED OPTIMIZATION: OPTIMALITY CONDITIONS, OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION, Proximal Proper Saddle Points in Set-Valued Optimization, Geoffrion proper efficiency in an infinite dimensional space, A conic scalarization method in multi-objective optimization, NECESSARY OPTIMALITY CONDITIONS FOR SUPER MINIMIZERS IN STRUCTURAL PROBLEMS OF MULTIOBJECTIVE OPTIMIZATION, Unnamed Item, Two methods for determining properly effcient solutions with a minimum upper bound for trade-offs, Nonlinear scalarization in multiobjective optimization with a polyhedral ordering cone, Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming, Super Efficiency in Vector Optimization, Higher-order Karush–Kuhn–Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming, On the optimality conditions for D.C. vector optimization problems, The Role of Cardinal Utilities in Multiple Objective Programming, Strong and weak conditions of regularity and optimality, A note on approximate proper efficiency in linear fractional vector optimization, Generalized polarity and weakest constraint qualifications in multiobjective optimization, An extension of the Kaliszewski cone to non-polyhedral pointed cones in infinite-dimensional spaces, Second-order strong Karush/Kuhn-Tucker conditions for proper efficiencies in multiobjective optimization, Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems, Sublinear scalarizations for proper and approximate proper efficient points in nonconvex vector optimization, Bilevel optimization with a multiobjective problem in the lower level, Optimality conditions for multiobjecttve and nonsmooth minimisation in abstract spaces, Stability of optimal points with respect to improvement sets, Generalized higher-order semi-derivative of the perturbation maps in vector optimization, Pareto efficiency without topology, Weak Henig proper solution sets for set optimization problems, Approximate properly solutions of constrained vector optimization with variable coradiant sets, Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization, On a practical notion of Geoffrion proper optimality in multicriteria optimization, Vector subdifferentials via recession mappings∗∗this research was supported by grants from M.U.R.S.T (Itall) and the australian research council.$ef:, Duality for Multiobjective Variational Problems With Pseudo-Invexity, On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming, On the characterization of efficient points by means of monotone functionals, Characterization of substantially and quasi-substantially efficient solutions in multiobjective optimization problems, Quasi-proper efficiency: a quantitative enhanced efficiency, Optimization over the efficient set, Existence of efficient and properly efficient solutions to problems of constrained vector optimization, Pareto efficiency in locally convex spaces i, Superefficiency in local convex spaces, Stability results for efficient solutions of vector optimization problems, Generating properly efficient points in multi-objective programs by the nonlinear weighted sum scalarization method, Nonlinear separation methods and applications for vector equilibrium problems using improvement sets, New results on proper efficiency for a class of vector optimization problems, Well-posedness and stability in vector optimization problems using Henig proper efficiency, Optimality conditions for maximizations of set-valued functions, Scalarization in vector optimization, Optimality conditions for maximizations of set-valued functions, Optimality Conditions for Semivectorial Bilevel Convex Optimal Control Problems, Two kinds of normality in vector optimization, Necessary conditions for super minimizers in constrained multiobjective optimization, Proximal proper efficiency for minimisation with respect to normal cones, ε–Optimality to approximation in partially ordered spaces, Approximate proper solutions in vector equilibrium problems. Limit behavior and linear scalarization results, Soluciones propias en la teoria de la dominacion, Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces, Characterization of properly optimal elements with variable ordering structures, Hartley proper efficiency in multiobjective optimization problems with locally Lipschitz set-valued objectives and constraints, Existence and density results for proper efficiency in cone compact sets, On Efficient Solutions with Trade-Offs Bounded by Given Values, Trade-off ratio functions for linear and piecewise linear multi-objective optimization problems, Geometry of optimality conditions and constraint qualifications: The convex case, Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps, Set Optimization—A Rather Short Introduction, Approximate proper efficiency in vector optimization, A generalization of a theorem of Arrow, Barankin and Blackwell to a nonconvex case, Stability analysis of conically perturbed linearly constrained least-squares problems by optimizing the regularized trajectories, Strong Duality with Proper Efficiency in Multiobjective Optimization Involving Nonconvex Set-Valued Maps, Sensitivity analysis using the tangent derivative, Super efficiency in convex vector optimization, On necessary and sufficient optimality conditions for multicriterial optimization problems, A notion of local proper efficiency in the Borwein sense in vector optimisation, Vector equilibrium problems under improvement sets and linear scalarization with stability applications, Existence theorems of set optimization with set-valued maps, Anchor points in multiobjective optimization: definition, characterization and detection, Approximating families of cones and proper efficiency in vector optimization, Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization, Direct theorems in semi-infinite convex programming, Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization, E-Benson proper efficiency in vector optimization, Existence and characterization of efficient decisions with respect to cones, New notions of proper efficiency in set optimization with the set criterion, Characterizations of Hartley proper efficiency in nonconvex vector optimization, Definition and characterization of Geoffrion proper efficiency for real vector optimization with infinitely many criteria, Improperly efficient solutions in a class of vector optimization problems
