The compromise hypersphere for multiobjective linear programming
From MaRDI portal
Publication:1869399
DOI10.1016/S0377-2217(01)00388-5zbMath1028.90049MaRDI QIDQ1869399
Saul I. Gass, Pallabi Guha Roy
Publication date: 10 April 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (8)
Use of the Reduced Tolerance Approach to Rank Efficient Solutions ⋮ A class of rough multiple objective programming and its application to solid transportation problem ⋮ On an approximate minimax circle closest to a set of points. ⋮ Compromise programming with Tchebycheff norm for discrete stochastic orders ⋮ The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces ⋮ Fully piecewise linear vector optimization problems ⋮ Structure of Pareto solutions of generalized polyhedral-valued vector optimization problems in Banach spaces ⋮ Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interactive scheme for a MOLP problem given two partial orders: One on variables and one on objectives
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Multiple attribute decision making. Methods and applications. A state-of- the-art survey
- Multiobjective programming and planning
- Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Linear multiobjective programming
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Proper efficiency and the theory of vector maximization
- Note on the mean-square strategy for vector-valued objective functions
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
- Efficient Algorithms for the (Weighted) Minimum Circle Problem
- An Interactive Programming Method for Solving the Multiple Criteria Problem
- An interactive weighted Tchebycheff procedure for multiple objective programming
- A revised simplex method for linear multiple objective programs
- Parametric Objective Function (Part 2)—Generalization
- Linear programming with multiple objective functions: Step method (stem)
- A Class of Solutions for Group Decision Problems
This page was built for publication: The compromise hypersphere for multiobjective linear programming
