Proper efficiency and the theory of vector maximization
From MaRDI portal
Publication:2534839
DOI10.1016/0022-247X(68)90201-1zbMATH Open0181.22806MaRDI QIDQ2534839FDOQ2534839
Authors: A. M. Geoffrion
Publication date: 1968
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strictly Concave Parametric Programming, Part II: Additional Theory and Computational Considerations
- Letter to the Editor—Improper Solutions of the Vector Maximum Problem
Cited In (only showing first 100 items - show all)
- Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency
- On efficiency in nonlinear fractional vector maximization problem
- An approximate strong KKT condition for multiobjective optimization
- Dynamic parametric bounds on efficient outcomes in interactive multiple criteria decision making problems
- Duality in nondifferentiable vector programming
- Generalized \((F,\rho )\)-convexity and duality in nonsmooth problems of multiobjective optimization
- Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions
- Compromise solutions and estimation of the noninferior set
- Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints
- Exponential transformation in convexifying a noninferior frontier and exponential generating method
- Equilibrium solutions for multiobjective bimatrix games incorporating fuzzy goals
- Efficiency in linear fractional vector maximization problem with nonlinear constraints
- On economic equilibrium type problems with applications
- On the efficiency of price competition
- On first order optimality conditions for vector optimization
- Bi-objective multistage stochastic linear programming
- Efficiency and generalised convexity in vector optimisation problems
- Vector continuous-time programming without differentiability
- Multi-choice goal programming formulation based on the conic scalarizing function
- Well-posedness and stability in vector optimization problems using Henig proper efficiency
- Duality theory in multiobjective programming
- Optimality theorems for convex semidefinite vector optimization problems
- Density theorems for generalized Henig proper efficiency
- Duality theory for the matrix linear programming problem
- Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
- Duality for nonlinear multiple-criteria optimization problems
- Super efficiency of multicriterion network equilibrium model and vector variational inequality
- On the notion of proper efficiency in vector optimization
- Pareto efficiency in locally convex spaces i
- Cones admitting strictly positive functionals and scalarization of some vector optimization problems
- Efficiency and proper efficiency in nonlinear vector maximum problems
- Linguistic multi-criteria decision-making with representing semantics by programming
- Weakly and properly nonessential objectives in multiobjective optimization problems
- A multi-objective programming approach to 1.5-dimensional assortment problem
- The structure of admissible points with respect to cone dominance
- Inverse radiation therapy planning -- a multiple objective optimization approach
- Generalized Proper Efficiency in Multiobjective Programming
- Out of the mist -- towards decision-maker-friendly multiple criteria decision making support
- Some relations between variational-like inequalities and efficient solutions of certain nonsmooth optimization problems
- Variable preference modeling with ideal-symmetric convex cones
- Vector variational inequalities for nondifferentiable convex vector optimization problems
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
- Pareto optimality and Walrasian equilibria
- Vector maximization with two objective functions
- A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
- Enhanced efficiency in multi-objective optimization
- Wolfe type second order nondifferentiable symmetric duality in multiobjective programming over cone with generalized \((K, F)\)-convexity
- Stochastic multiobjective optimization: Sample average approximation and applications
- Inner and outer estimates for the solution sets and their asymptotic cones in vector optimization
- Stability of properly efficient points and isolated minimizers of constrained vector optimization problems
- Derivatives of set-valued maps and gap functions for vector equilibrium problems
- Properly optimal elements in vector optimization with variable ordering structures
- \(\epsilon \)-Henig proper efficiency of set-valued optimization problems in real ordered linear spaces
- An approximation algorithm for convex multi-objective programming problems
- A multicriteria approach to the location of public facilities
- Boundedness and nonemptiness of the efficient solution sets in multiobjective optimization
- Multiobjective fractional programming duality theory
- The compromise hypersphere for multiobjective linear programming
- On linear vector program and vector matrix game equivalence
- An approximation method for the efficiency set of multiobjective programming problems
- First and second-order optimality conditions for convex composite multiobjective optimization
- Infine functions and nonsmooth multiobjective optimization problems
- Hartley proper efficiency in multiobjective optimization problems with locally Lipschitz set-valued objectives and constraints
- Invex nonsmooth alternative theorem and applications*
- Generalised convexity and duality in multiple objective programming
- A Dual For A Multiple Objective Fractional Programming Problem
- Dual approach to minimization on the set of Pareto-optimal solutions
- Technical Note—Proper Efficiency and the Linear Fractional Vector Maximum Problem
- Shortest paths in networks with vector weights
- Proper efficiency in vector infinite programming problems
- Saddle points and Pareto points in multiple objective programming
- Between Pareto efficiency and Pareto ε-efficiency
- \((p,r)\)-invexity in multiobjective programming.
- The domination property in multicriteria optimization
- Optimizing over the properly efficient set of convex multi-objective optimization problems
- An interactive multiobjective programming approach to combinatorial data analysis
- Concepts of proper efficiency
- On weak and strong Kuhn-Tucker conditions for smooth multiobjective optimization
- Introducing nonpolyhedral cones to multiobjective programming
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- A notion of local proper efficiency in the Borwein sense in vector optimisation
- Optimality and duality results for a nondifferentiable multiobjective fractional programming problem
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- Proximal proper efficiency for minimisation with respect to normal cones
- Multiobjective symmetric duality with invexity
- Higher-Order Duality in Nondifferentiable Multiobjective Programming
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- Scalarization of \(\epsilon\)-super efficient solutions of set-valued optimization problems in real ordered linear spaces
- Mixed type duality in multiobjective fractional programming under generalized \(\rho\)-univex function
- Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
- Algorithms for the vector maximization problem
- Two methods for determining properly effcient solutions with a minimum upper bound for trade-offs
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Multiobjective programming under generalized type I invexity
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Strongly proper efficient solutions: efficient solutions with bounded trade-offs
- Constrained optimization using multiple objective programming
- Pre-invex functions in multiple objective optimization
- Optimality Conditions and Duality for Multiobjective Control Problems
- An interactive weighted Tchebycheff procedure for multiple objective 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)