A revised simplex method for linear multiple objective programs
From MaRDI portal
Cites work
- Algorithms for the vector maximization problem
- scientific article; zbMATH DE number 3175708 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- scientific article; zbMATH DE number 3069614 (Why is no real title available?)
- scientific article; zbMATH DE number 3078986 (Why is no real title available?)
- Proper efficiency and the theory of vector maximization
- Strictly Concave Parametric Programming, Part I: Basic Theory
Cited in
(85)- On efficient sets in vector maximum problems - A brief survey
- Stability in vector maximization - a survey
- Analysis of multicriteria decision aid in Europe
- Interactive relaxation method for a broad class of integer and continuous nonlinear multiple criteria problems
- Weighting factor extensions for finite multiple objective vector minimization problems
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
- Solving a bicriterion scheduling problem
- Application of primitive sets to multi-criteria optimization problems
- Duality for nonlinear multiple-criteria optimization problems
- Bicriteria linear fractional programming
- Multicriteria analysis: Survey and new directions
- Relaxation analysis in linear vectorvalued maximization
- Linear programming with multiple fuzzy goals
- Admissible points of a convex polyhedron
- An algorithm for the multiple objective integer linear programming problem
- On a domination property for vector maximization with respect to cones
- Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
- Goal programming with linear fractional criteria
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
- Transformation and restructuring of linear multiobjective programs: A fundamental method to resolve complex problems
- A note on solving bicriteria linear programming problems using single criteria software
- Efficient solutions for the bicriteria network flow problem
- Redundant objective functions in linear vector maximum problems and their determination
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- Existence of efficient solutions for vector maximization problems
- An interactive method as an aid in solving multi-objective mathematical programming problems
- The structure of admissible points with respect to cone dominance
- Generating all maximal efficient faces for multiple objective linear programs
- Inverse programming and the linear vector maximization problem
- Connectedness of efficient solutions in multiple criteria combinatorial optimization
- New closedness results for efficient sets in multiple objective mathematical programming
- A restricted class of multiobjective linear fractional programming problems
- Approximating the noninferior set in multiobjective linear programming problems
- Finding all maximal efficient faces in multiobjective linear programming
- Determination of the efficient set in multiobjective linear programming
- Multiobjective flow control in delay constrained telecommunication networks
- Optimizing a linear function over an efficient set
- Random problem genertion and the computation of efficient extreme points in multiple objective linear programming
- Maximal descriptor set characterizations of efficient faces in multiple objective linear programming.
- Optimization over the efficient set of a parametric multiple objective linear programming problem
- Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming
- The vector linear program solver \textit{Bensolve} -- notes on theoretical background
- A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems
- Tractability of convex vector optimization problems in the sense of polyhedral approximations
- A modified TOPSIS method based on \(D\) numbers and its applications in human resources selection
- Approximating the noninferior set in linear biobjective programs using multiparametric decomposition
- Solving zero-one multiple objective programs through implicit enumeration
- Concepts of proper efficiency
- Growth and utility maximization.
- The compromise hypersphere for multiobjective linear programming
- Multiobjective integer nonlinear fractional programming problem: a cutting plane approach
- Biobjective optimization over the efficient set of multiobjective integer programming problem
- A norm minimization-based convex vector optimization algorithm
- GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
- The maximal descriptor index set for a face of a convex polyhedral set and some applications
- Bilevel linear programming
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
- A cutting plane approach for multi-objective integer indefinite quadratic programming problem
- A new exact method for linear bilevel problems with multiple objective functions at the lower level
- A criterion space search algorithm for biobjective integer programming: the balanced box method
- Application of vector optimization processes in large-scale models
- The attainment of the solution of the dual program in vertices for vectorial linear programs
- Goal Programming Methods and Applications: A Survey
- Engineering design: applications of goal programming and multiple objective linear and geometric programming‡
- Theory and algorithms for linear multiple objective programs with zero–one variables
- Efficiency in multiple objective optimization problems
- Vector maximization at a degenerate vertex
- On some relations between a dual pair of multiple objective linear programs
- Linear multiple objective programs with zero–one variables
- Finding all efficient extreme points for multiple objective linear programs
- Solution procedures for multi-objective markov decision processes
- Generation of efficient and ε -efficient solutions in multiple objective linear programming
- Characterizing coherence, correcting incoherence
- A parametric simplex algorithm for linear vector optimization problems
- A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
- Application of fuzzy multiple goal programming on the selection for power plants considering site and environmental constraints
- Optimization over the efficient set
- Use of the Reduced Tolerance Approach to Rank Efficient Solutions
- Convergence analysis of a norm minimization-based convex vector optimization algorithm
- Sensitivity analysis of multiobjective linear programming from a geometric perspective
- Benders decomposition for bi-objective linear programs
- A regression study of the number of efficient extreme points in multiple objective linear programming
- Potential solutions of linear systems: the multi-criteria multiple constraint levels program
- A compromise procedure for the multiple objective linear fractional programming problem
- SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems
This page was built for publication: A revised simplex method for linear multiple objective programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4766797)
