Pages that link to "Item:Q1102178"

The following pages link to Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam (Q1102178):

Displaying 36 items.

• Separable discrete preferences (Q2486167) (← links)
• Continuity properties of solutions of vector optimization (Q2490785) (← links)
• Permutations of separable preference orders (Q2492224) (← links)
• Generating well-behaved utility functions for compromise programming (Q2564167) (← links)
• Single-peaked preferences over multidimensional binary alternatives (Q2636803) (← links)
• An upper bound on properly efficient solutions in multiobjective optimization (Q2638949) (← links)
• Dynamic MCDM, Habitual Domains and Competence Set Analysis for Effective Decision Making in Changeable Spaces (Q3058458) (← links)
• Decentralized Cooperative Optimization for Multi-criteria Decision Making (Q3564108) (← links)
• Introducing Nonpolyhedral Cones to Multiobjective Programming (Q3649588) (← links)
• (Q4309862) (← links)
• An Algorithm For Solving Multiple Objective Integer Linear Programming Problem (Q4457893) (← links)
• Effective Decision Making in Changeable Spaces, Covering and Discovering Processes: A Habitual Domain Approach (Q4562490) (← links)
• Dynamics of international financial networks with risk management (Q4610235) (← links)
• Primal and dual algorithms for optimization over the efficient set (Q4646523) (← links)
• (Q4963438) (← links)
• Solving Optimization Problems over the Weakly Efficient Set (Q4985181) (← links)
• Solving multiobjective optimisation problems using genetic algorithms and solutions concepts of cooperative games (Q5046877) (← links)
• A first bibliography on set and vector optimization problems with respect to variable domination structures (Q5052588) (← links)
• Application of the stochastic fractal search algorithm and compromise programming to combined heat and power economic–emission dispatch (Q5059467) (← links)
• Lagrange multiplier rules for weak approximate Pareto solutions to constrained vector optimization problems with variable ordering structures (Q5090300) (← links)
• Existence of Lagrange Multipliers under Gâteaux Differentiable Data with Applications to Stochastic Optimal Control Problems (Q5215516) (← links)
• A New Scalarization Technique and New Algorithms to Generate Pareto Fronts (Q5266532) (← links)
• An iterative method for solving the strong vector equilibrium problem with variable domination structure (Q5745168) (← links)
• Generalized convex duality for multiobjective fractional programs (Q5905519) (← links)
• On vector variational inequalities (Q5917816) (← links)
• A necessary and sufficient condition for minimizing a convex Fréchet differentiable function on a certain hyperplane. (Q5927568) (← links)
• Searching for joint gains in multi-party negotiations. (Q5932023) (← links)
• Axiomatic characterizations of the CEA solution for rationing problems (Q5937356) (← links)
• An interior-point approach for solving MC\(^2\) linear programming problems (Q5943367) (← links)
• Multicriteria hub decision making for rural area telecommunication networks (Q5943929) (← links)
• Using fuzzy measures and habitual domains to analyze the public attitude and apply to the gas taxi policy (Q5956210) (← links)
• Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems (Q6048198) (← links)
• Well-posedness for bilevel vector equilibrium problems with variable domination structures (Q6049707) (← links)
• Geometric compromise programming: application in portfolio selection (Q6079996) (← links)
• On the study of multistage stochastic vector quasi-variational problems (Q6109054) (← links)
• Approximating biobjective minimization problems using general ordering cones (Q6162511) (← links)