Pages that link to "Item:Q857285"

The following pages link to Generating \(\varepsilon\)-efficient solutions in multiobjective programming (Q857285):

Displaying 33 items.

• A combined scalarizing method for multiobjective programming problems (Q299884) (← links)
• Necessary and sufficient Karush-Kuhn-Tucker conditions for multiobjective Markov chains optimality (Q313188) (← links)
• Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits (Q336534) (← links)
• A numerical method for constructing the Pareto front of multi-objective optimization problems (Q390465) (← links)
• On approximating weakly/properly efficient solutions in multi-objective programming (Q410073) (← links)
• Generating equidistant representations in biobjective programming (Q429518) (← links)
• A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets (Q467443) (← links)
• The multicriteria big cube small cube method (Q611015) (← links)
• Algebra of efficient sets for multiobjective complex systems (Q635798) (← links)
• Integrated business continuity and disaster recovery planning: towards organizational resilience (Q726259) (← links)
• Tradeoff-based decomposition and decision-making in multiobjective programming (Q1042253) (← links)
• Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems (Q1044130) (← links)
• A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems (Q1670109) (← links)
• An iterative approach to solve multiobjective linear fractional programming problems (Q1991300) (← links)
• On approximate efficiency for nonsmooth robust vector optimization problems (Q2153390) (← links)
• A new scalarization method for finding the efficient frontier in non-convex multi-objective problems (Q2285911) (← links)
• On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives (Q2311119) (← links)
• Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems (Q2356347) (← links)
• Sustainability SI: multimode multicommodity network design model for intermodal freight transportation with transfer and emission costs (Q2357879) (← links)
• Cone characterizations of approximate solutions in real vector optimization (Q2471114) (← links)
• Improving the min-max method for multiobjective programming (Q2661504) (← links)
• A combined scalarization method for multi-objective optimization problems (Q2666683) (← links)
• On approximate starshapedness in multiobjective optimization (Q2815506) (← links)
• Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization (Q2841152) (← links)
• Characterizing ϵ-properly efficient solutions (Q2943836) (← links)
• A unified vector optimization problem: complete scalarizations and applications (Q3111143) (← links)
• A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems (Q3112505) (← links)
• (Q3383228) (← links)
• On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems (Q5244131) (← links)
• The modified objective-constraint scalarization approach for multiobjective optimization problems (Q5870938) (← links)
• (Q6039732) (← links)
• Sustainable supplier selection model with a trade-off between supplier development and supplier switching (Q6148724) (← links)
• A flexible objective-constraint approach and a new algorithm for constructing the Pareto front of multiobjective optimization problems (Q6192422) (← links)