Pages that link to "Item:Q1245164"
From MaRDI portal
The following pages link to Existence of efficient solutions for vector maximization problems (Q1245164):
Displaying 50 items.
- Quadratic scalarization for decomposed multiobjective optimization (Q331788) (← links)
- On Benson's scalarization in multiobjective optimization (Q518145) (← links)
- Multicriteria optimization with a multiobjective golden section line search (Q662303) (← links)
- Linear complementarity problems and multiple objective programming (Q689137) (← links)
- A solution concept for fuzzy multiobjective programming problems based on convex cones. (Q703184) (← links)
- Computation of efficient compromise arcs in convex quadratic multicriteria optimization (Q813340) (← links)
- An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems (Q828841) (← links)
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming (Q857285) (← links)
- Constrained optimization using multiple objective programming (Q878220) (← links)
- Linear bilevel programs with multiple objectives at the upper level (Q970382) (← links)
- Solutions of fuzzy multiobjective programming problems based on the concept of scalarization (Q1014024) (← links)
- Computational approach to essential and nonessential objective functions in linear multicriteria optimization (Q1014036) (← links)
- Efficiency and proper efficiency in vector maximization with respect to cones (Q1055343) (← links)
- On efficient sets in vector maximum problems - A brief survey (Q1068004) (← links)
- On the completeness and constructiveness of parametric characterizations to vector optimization problems (Q1075949) (← links)
- Weighting factor results in vector optimization (Q1093548) (← links)
- An improved definition of proper efficiency for vector maximization with respect to cones (Q1131964) (← links)
- Admissible points of a convex polyhedron (Q1157772) (← links)
- Properly efficient and efficient solutions for vector maximization problems in Euclidean space (Q1159137) (← links)
- An all-linear programming relaxation algorithm for optimizing over the efficient set (Q1177916) (← links)
- Multiple-objective programming with polynomial objectives and constraints (Q1197675) (← links)
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set (Q1321160) (← links)
- Vector optimization and generalized Lagrangian duality (Q1339225) (← links)
- Optimizing a linear function over an efficient set (Q1342462) (← links)
- Multiplicative programming problems: Analysis and efficient point search heuristic (Q1367730) (← links)
- A multiple objective methodology for sugarcane harvest management with varying maturation periods (Q1615948) (← links)
- Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique (Q1659228) (← links)
- Second-order optimality conditions for multiobjective optimization whose order induced by second-order cone (Q1660295) (← links)
- Second-order optimality conditions for cone constrained multi-objective optimization (Q1717017) (← links)
- On gap functions for nonsmooth multiobjective optimization problems (Q1744623) (← links)
- Dynamic multi-objective heating optimization (Q1847237) (← links)
- A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions (Q1892603) (← links)
- Retrieval and use of the balance set in multiobjective global optimization (Q1962989) (← links)
- A graphical characterization of the efficient set for convex multiobjective problems (Q2271819) (← links)
- Comparison of some scalarization methods in multiobjective optimization (Q2272601) (← links)
- A smooth proximity measure for optimality in multi-objective optimization using Benson's method (Q2297582) (← links)
- A discussion of scalarization techniques for multiple objective integer programming (Q2379880) (← links)
- Exact generation of epsilon-efficient solutions in multiple objective programming (Q2460074) (← links)
- Optimizing a linear function over an integer efficient set (Q2503083) (← links)
- Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points (Q2664305) (← links)
- A new exact method for linear bilevel problems with multiple objective functions at the lower level (Q2673580) (← links)
- Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy (Q2935310) (← links)
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming (Q3468895) (← links)
- Introducing Nonpolyhedral Cones to Multiobjective Programming (Q3649588) (← links)
- Pareto efficiency in locally convex spaces i (Q3816593) (← links)
- An Algorithm For Solving Multiple Objective Integer Linear Programming Problem (Q4457893) (← links)
- Proper efficiency, scalarization and transformation in multi-objective optimization: unified approaches (Q5070621) (← links)
- On a practical notion of Geoffrion proper optimality in multicriteria optimization (Q5131816) (← links)
- Optimization over the efficient set (Q5896268) (← links)
- Optimization of a linear function over an integer efficient set (Q6059580) (← links)
