Proper efficiency and the theory of vector maximization
From MaRDI portal
Publication:2534839
Recommendations
- Technical Note—Proper Efficiency and the Linear Fractional Vector Maximum Problem
- Proper Efficiency in Convex Vector Minimum Problems
- Generalized Proper Efficiency in Multiobjective Programming
- On efficient sets in vector maximum problems - A brief survey
- On the notion of proper efficiency in vector optimization
Cites work
- scientific article; zbMATH DE number 3175708 (Why is no real title available?)
- scientific article; zbMATH DE number 3225772 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- scientific article; zbMATH DE number 3078986 (Why is no real title available?)
- Letter to the Editor—Improper Solutions of the Vector Maximum Problem
- Strictly Concave Parametric Programming, Part II: Additional Theory and Computational Considerations
Cited in
(only showing first 100 items - show all)- Improved -constraint method for multiobjective programming
- On properness and protectiveness in two-person multicriteria games
- Determining maximal efficient faces in multiobjective linear programming problem
- On G-invex multiobjective programming. I: Optimality
- Nondifferentiable multiobjective programming under generalized \(d_I\)-invexity
- On the characterization of noninferior solutions of the vector optimization problem
- Fuzzy programming and the Pareto optimal set
- Efficiency and proper efficiency in vector maximization with respect to cones
- On multiple objective programming problems with set functions
- A characterization of properly efficient solutions by an augmented Tchebycheff norm
- On efficient sets in vector maximum problems - A brief survey
- Stability in vector maximization - a survey
- Analysis of multicriteria decision aid in Europe
- A survey of vector optimization in infinite-dimensional spaces. II
- Decomposition of the parametric space in multiobjective convex programs using the generalized Tchebycheff norm
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- An algorithm for the bi-criterion integer programming problem
- Zero-one programming with multiple criteria
- Proper D-solutions of multiobjective programming problems with set functions
- Multiplicative decision rules for multiobjective decision problems
- A matrix generalization of a vector maximization problem
- Duality theory for the matrix linear programming problem
- Interactive algorithms for multiple criteria nonlinear programming problems
- A fuzzy preference relation in the vector maximum problem
- Lagrangian function and duality theory in multiobjective programming with set functions
- Weighting factor results in vector optimization
- Characterizing the nondominated set by separable functions
- Interactive fuzzy decision making for multiobjective nonlinear programming using augmented minimax problems
- The domination property in multicriteria optimization
- A modified weighted Tchebycheff metric for multiple objective programming
- Multiobjective duality with invexity
- A converse duality theorem in multiple objective programming
- Families of differentiable scalarization functions
- Characterizing optimality in mathematical programming models
- Proper efficiency in a linear fractional vector maximum problem with generalized convex constraints
- Pre-invex functions in multiple objective optimization
- Semilocal pseudolinearity and efficiency
- Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
- A unified approach for characterizing Pareto optimal solutions of multiobjective optimization problems: The hyperplane method
- Solving a bicriterion scheduling problem
- An improved definition of proper efficiency for vector maximization with respect to cones
- Compromise solutions and estimation of the noninferior set
- Generalization of Fenchel's duality theorem for convex vector optimization
- A multicriteria approach to the location of public facilities
- Application of primitive sets to multi-criteria optimization problems
- Linear programming with partial information
- Duality for nonlinear multiple-criteria optimization problems
- Lexocographic multipliers
- Finding efficient solutions for rectilinear distance location problems efficiently
- Pareto optimal policies for harvesting with multiple objectives
- Proper efficiency with respect to cones
- Bicriteria linear fractional programming
- Multicriteria analysis: Survey and new directions
- Relaxation analysis in linear vectorvalued maximization
- Differential games with nonzero sum (cooperative variant)
- On proper and improper efficient solutions of optimal problems with multicriteria
- Admissible points of a convex polyhedron
- Multicriteria dynamic programming with an application to the integer case
- 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
- Goal programming with linear fractional criteria
- Optimality conditions in nonconical multiple objective programming
- Characterization of properly efficient solutions by generalized scalarization methods
- Proper efficiency in nonconvex vector-maximization-problems
- The equilibria of a multiple objective game
- Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming
- Duality for multiobjective variational problems
- On efficiency and duality for multiobjective programs
- Optimal stationary policies in the vector-valued Markov decision process
- Nonlinear multiple objective optimization: An algorithm and some theory
- Optimality and duality for multiobjective nonsmooth programming
- Multiple-objective programming with polynomial objectives and constraints
- Multiobjective, preference-based search in acyclic OR-graphs
- Pareto optimality in multiobjective problems
- Compromise solutions, domination structures, and Salukvadze's solution
- Vector maximization with two objective functions
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- Existence of efficient solutions for vector maximization problems
- Duality theory in multiobjective programming
- The structure of admissible points with respect to cone dominance
- Inverse programming and the linear vector maximization problem
- Kuhn-Tucker multipliers as trade-offs in multiobjective decision-making analysis
- Application of multiobjective optimization in aircraft control systems design
- Efficiency and generalized convex duality for multiobjective programs
- Characterizations of the Benson proper efficiency for nonconvex vector optimization
- Duality for multiobjective control problems with generalized invexity
- Optimality and duality for multiobjective fractional programming involving \(n\)-set functions
- On multiple-objective optimization with generalized univexity
- Exponential transformation in convexifying a noninferior frontier and exponential generating method
- Super efficient solutions and super infima in vector optimization
- Solvability of the vector problem by the linear criteria convolution algorithm
- Multicriteria planar location problems
- The maximization of a function over the efficient set via a penalty function approach
- Symmetric dual multiobjective programming
- A reference direction approach to multiple objective quadratic-linear programming
- Unified representation of proper efficiency by means of dilating cones
- A geometrical solution for quadratic bicriteria location models
- The gap function of a convex multicriteria optimization problem
- New closedness results for efficient sets in multiple objective mathematical programming
This page was built for publication: Proper efficiency and the theory of vector maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2534839)
