Pages that link to "Item:Q1220359"
From MaRDI portal
The following pages link to The set of all nondominated solutions in linear cases and a multicriteria simplex method (Q1220359):
Displayed 50 items.
- Biobjective robust optimization over the efficient set for Pareto set reduction (Q322934) (← links)
- Adjacency based method for generating maximal efficient faces in multiobjective linear programming (Q345543) (← links)
- TOPSIS for bi-level MODM problems (Q350411) (← links)
- Characterizing coherence, correcting incoherence (Q473384) (← links)
- Constructing a Pareto front approximation for decision making (Q532529) (← links)
- A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem (Q555995) (← links)
- Constructing efficient solutions structure of multiobjective linear programming (Q557002) (← links)
- Solution of multicriteria control problems in certain types of linear distributed-parameter systems by a multicriteria simplex method (Q599347) (← links)
- Finding DEA-efficient hyperplanes using MOLP efficient faces (Q609208) (← links)
- A volume flexible economic production lot-sizing problem with imperfect quality and random machine failure in fuzzy-stochastic environment (Q639044) (← links)
- A regression study of the number of efficient extreme points in multiple objective linear programming (Q706929) (← links)
- A semidefinite programming approach for solving multiobjective linear programming (Q742135) (← links)
- Solving multiple objective linear programs in objective space (Q749446) (← links)
- Potential solutions of linear systems: the multi-criteria multiple constraint levels program (Q754096) (← links)
- A compromise procedure for the multiple objective linear fractional programming problem (Q761358) (← links)
- A parametric approach to solving bicriterion shortest path problems (Q810382) (← links)
- SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems (Q828878) (← links)
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges (Q918867) (← links)
- A modified method for constructing efficient solutions structure of MOLP (Q967909) (← links)
- Computational approach to essential and nonessential objective functions in linear multicriteria optimization (Q1014036) (← links)
- Determining maximal efficient faces in multiobjective linear programming problem (Q1018182) (← links)
- A graphical subroutine for multiobjective linear programming (Q1055342) (← links)
- Careful usage of pessimistic values is needed in multiple objectives optimization (Q1060964) (← links)
- On efficient sets in vector maximum problems - A brief survey (Q1068004) (← links)
- Stability in vector maximization - a survey (Q1074503) (← links)
- Analysis of multicriteria decision aid in Europe (Q1075249) (← links)
- Interactive relaxation method for a broad class of integer and continuous nonlinear multiple criteria problems (Q1075943) (← links)
- An algorithm for optimizing over the weakly-efficient set (Q1077330) (← links)
- Some hybrid fixed point theorems related to optimization (Q1094659) (← links)
- Cone extreme points and faces (Q1095769) (← links)
- Interactive scheme for a MOLP problem given two partial orders: One on variables and one on objectives (Q1095788) (← links)
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program (Q1129976) (← links)
- Stability in multicriteria optimization (Q1131961) (← links)
- Linear programming with partial information (Q1145068) (← links)
- Duality for nonlinear multiple-criteria optimization problems (Q1145630) (← links)
- Bicriteria linear fractional programming (Q1148820) (← links)
- Multicriteria analysis: Survey and new directions (Q1154393) (← links)
- Relaxation analysis in linear vectorvalued maximization (Q1154395) (← links)
- Linear programming with multiple fuzzy goals (Q1154942) (← links)
- Admissible points of a convex polyhedron (Q1157772) (← links)
- Multicriteria dynamic programming with an application to the integer case (Q1158349) (← links)
- An algorithm for the multiple objective integer linear programming problem (Q1160567) (← links)
- On a domination property for vector maximization with respect to cones (Q1161684) (← links)
- Conflict dissolution by reframing game payoffs using linear perturbations (Q1161690) (← links)
- Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples (Q1161923) (← links)
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations (Q1169409) (← links)
- Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives (Q1170115) (← links)
- About Isermann duality (Q1173017) (← links)
- Bicriteria network flow problems: Continuous case (Q1175771) (← links)
- Multiple-objective programming with polynomial objectives and constraints (Q1197675) (← links)