An interactive approach for vector optimization problems
Article Abstract:
An interactive mathematical programming technique is employed for vector optimization problems. The best compromise solutions are determined by utilizing Geoffrion's method which relies on global preference. The stability set of the first kind is studied and employed to reduce the parametric space of the problem. This algorithm does not only guarantee an efficient solution but also the best compromise solution which can be satisfying for the decision maker.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
On finding dissimilar Pareto-optimal paths
Article Abstract:
The methods of finding alternative routes between source and destination for routing hazardous goods considering risk associated are discussed. Pareto-optima paths technique is used for routing.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
User Contributions:
Comment about this article or add new information about this topic:
Single item lot sizing problems
Article Abstract:
Mathematical programming methods, which are used to examine production planning problems, are presented.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Iterative restart technique for solving timetabling problems. Memetic algorithm timetabling for non-commercial sport leagues
- Abstracts: Comparison of iterative improvement techniques for schedule optimization. Local search for shift design
- Abstracts: A linear approximation model for the parameter design problem. Heuristic methods for gang-rip saw arbor designs
- Abstracts: Stronger K-tree relaxations for the vehicle routing problem. A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
- Abstracts: Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints