Results 1 to 10 of about 91,752 (312)
Multiple Objective Linear Fractional Programming
Management Science, 1981 This paper presents a simplex-based solution procedure for the multiple objective linear fractional programming problem. By (1) departing slightly from the traditional notion of efficiency and (2) augmenting the feasible region as in goal programming ...
Ralph E. Steuer +1 more
core +2 more sources
Goal programming using multiple objective tabu search
Journal of the Operational Research Society, 2001 Goal programming (GP) is one of the most commonly used mathematical programming tools to model multiple objective optimisation (MOO) problems, There are numerous MOO problems of various complexity modelled using GP in the literature, One of the main ...
Adil Baykasoğlu
exaly +2 more sources
Integer Programming Duality in Multiple Objective Programming [PDF]
Journal of Global Optimization, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kathrin Klamroth +2 more
openaire +1 more source
Multiple Objective Programming Support [PDF]
, 2001 This paper gives a brief introduction into multiple objective programming support. We will overview basic concepts, formulations, and principles of solving multiple programming problems.To solve those problems requires the the intervention of a decision-maker.
openaire +3 more sources
Approximating Pareto frontier using a hybrid line search approach [PDF]
, 2010 This is the post-print version of the final paper published in Information Sciences. The published article is available from the link below. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting ...
Abraham, A, Grosan, C
core +1 more source
, 2007 The well-known quality improvement methodology, robust design, is a powerful and cost-effective technique for building quality into the design of products and processes.
Antony, Jiju +2 more
core +1 more source
Ideal points in multiobjective programming [PDF]
, 1993 The main object of this paper is to give conditions under which a minimal solution to a problem of mathematical programming can be transformed into a minimum solution in the usual sense of the order relations, or in every case, conditions under which ...
Balbás, Alejandro +2 more
core
Generalised convexity and duality in multiple objective programming [PDF]
Bulletin of the Australian Mathematical Society, 1989 By considering the concept of weak minima, different scalar duality results are extended to multiple objective programming problems. A number of weak, strong and converse duality theorems are given under a variety of generalised convexity conditions.
Weir, T., Mond, B.
openaire +1 more source
An Interactive Fuzzy Satisficing Method for Fuzzy Random Multiobjective 0-1 Programming Problems through Probability Maximization Using Possibility [PDF]
, 2009 In this paper, we focus on multiobjective 0-1 programming problems under the situation where stochastic uncertainty and vagueness exist at the same time.
Matsui, Takeshi +3 more
core
Using objective values to start multiple objective linear programming algorithms [PDF]
European Journal of Operational Research, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. Arbel, P. Korhonen
openaire +2 more sources