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)- Multiobjective Problems with Nonsmooth Equality Constraints
- Primal-dual simplex method for multiobjective linear programming
- A modified weighted Tchebycheff metric for multiple objective programming
- Kuhn-Tucker multipliers as trade-offs in multiobjective decision-making analysis
- An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
- scientific article; zbMATH DE number 1417899 (Why is no real title available?)
- A review of multiobjective programming and its application in quantitative psychology
- Relations between vector continuous-time program and vector variational-type inequality
- Scalarization in vector optimization
- A result on vector variational inequalities with polyhedral constraint sets
- Outcome space partition of the weight set in multiobjective linear programming
- Norm-based approximation in multicriteria programming.
- Multi-scenario multi-objective optimization with applications in engineering design
- Constraint qualifications for Karush-Kuhn-Tucker conditions in multiobjective optimization
- On properties of semipreinvex functions
- An interactive method for multiple-objective mathematical programming problems
- Linear multiple objective programs with zero–one variables
- Direct theorems in semi-infinite convex programming
- scientific article; zbMATH DE number 4125173 (Why is no real title available?)
- Proper efficiency and duality for a new class of nonconvex multitime multiobjective variational problems
- A steepest descent method for vector optimization
- A cooperative fuzzy game theoretic approach to multiple objective design optimization
- Symmetric duality for a class of multiobjective fractional programming problems.
- An improved algorithm for solving biobjective integer programs
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- Solving a bicriterion scheduling problem
- The effects of adding objectives to an optimisation problem on the solution set
- Nondifferentiable multiobjective second-order symmetric duality
- Bicriteria linear fractional programming
- Generalized convex composite multi-objective nonsmooth programming and conditional proper efficiency
- Efficient spanning trees
- Semilocal \(E\)-preinvexity and its applications in nonlinear multiple objective fractional programming
- Multicriteria analysis: Survey and new directions
- Strict efficiency in vector optimization with nearly convexlike set-valued maps
- Optimality and duality in multiobjective fractional programming involving \(\rho\)-semilocally type I-preinvex and related functions
- Efficiency and generalized convex duality for multiobjective programs
- On efficient applications of \(G\)-Karush-Kuhn-Tucker necessary optimality theorems to multiobjective programming problems
- Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions.
- Decentralized method for computing Pareto solutions in multiparty negotiations
- Multiple objective minimum cost flow problems: a review
- Optimality and duality for multiobjective fractional programming involving \(n\)-set functions
- A reference direction approach to multiple objective quadratic-linear programming
- \(L\)-invex-infine functions and applications
- On spanning tree problems with multiple objectives
- Weak efficiency for multiobjective variational problems.
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Retrieval and use of the balance set in multiobjective global optimization
- Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
- Problems and methods with multiple objective functions
- A unified approach for characterizing Pareto optimal solutions of multiobjective optimization problems: The hyperplane method
- A remark on multiobjective stochastic optimization via strongly convex functions
- An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization
- Finding efficient solutions for rectilinear distance location problems efficiently
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
- Nonlinear multiple objective optimization: An algorithm and some theory
- Robustness in nonsmooth nonlinear multi-objective programming
- Constructing efficient solutions structure of multiobjective linear programming
- A class of stochastic optimization problems with one quadratic \& several linear objective functions and extended portfolio selection model
- Constraint qualifications in convex vector semi-infinite optimization
- An \(\eta\)-approximation method in nonlinear vector optimization
- Approximate representation of the Pareto frontier in multiparty negotiations: decentralized methods and privacy preservation
- Inverse DEA with frontier changes for new product target setting
- Efficiency in Euclidean constrained location problems
- Determining maximal efficient faces in multiobjective linear programming problem
- On the convergence of adaptive stochastic search methods for constrained and multi-objective black-box optimization
- Quadratic scalarization for decomposed multiobjective optimization
- Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization
- Convex composite multi-objective nonsmooth programming
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- Analysis of multicriteria decision aid in Europe
- Convexification of a noninferior frontier
- Zero-one programming with multiple criteria
- Multi-choice multi-objective mathematical programming model for integrated production planning: a case study
- The equilibria of a multiple objective game
- An exact algorithm for biobjective mixed integer linear programming problems
- Optimality conditions for directionally differentiable multi-objective programming problems
- A multiobjective optimization framework for optimal selection of supplier portfolio
- On solution sets for affine vector variational inequality
- Existence of efficient solutions for vector maximization problems
- A new algorithm for solving planar multiobjective location problems involving the Manhattan norm
- Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
- Proper efficiency and proper Karush-Kuhn-Tucker conditions for smooth multiobjective optimization problems
- Optimal stationary policies in the vector-valued Markov decision process
- \(\varPhi _1\)-concavity and fuzzy multiple objective decision making
- Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions
- A matrix generalization of a vector maximization problem
- Proper efficiency conditions and duality for multiobjective programming problems involving semilocally invex functions
- Linear programming with partial information
- Integrated system modeling and optimization via quasilinearization
- scientific article; zbMATH DE number 3891125 (Why is no real title available?)
- Decomposition of the parametric space in multiobjective convex programs using the generalized Tchebycheff norm
- Stability in vector maximization - a survey
- Zur Entscheidungstheorie bei mehrfacher Zielsetzung
- Approximating the noninferior set in multiobjective linear programming problems
- Inverse programming and the linear vector maximization problem
- Proper efficiency and cardinal utilities in multicriteria decision making
- Multiple objective programming with piecewise linear functions
- A characterization of properly efficient solutions by an augmented Tchebycheff norm
- Theoretical aspects of multicriteria flight gate scheduling: Deterministic and fuzzy models
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)