Minimax regret solution to linear programming problems with an interval objective function

Article Abstract:

A new approach to solving linear programming problems with an interval objective function is introduced. The technique, which is based on the use of the minimax regret criterion as used in decision theory, is developed into a final decision method for use with a given reference solution set. Based on a relaxation procedure, it involves repeated use of the simplex method and provides the minimax regret solution when the reference solution set is the set of possible optimal solutions. A numerical example is also discussed.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

Manpower allocation using genetic annealing

Article Abstract:

A genetic annealing-based metaheuristic is proven to be superior to other metaheuristics and the conventional integer programming approach in solving real-size manpower allocation problems. Factors determined as instrumental in the success of the metaheuristic as a manpower alocation tool have been determined as encoding, selection of operators and the selection and acceptance methods used.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set

Article Abstract:

Research describing solutions to multiobjective optimization problems is presented. In particular the minimization of the convex function over the weakly efficient set is investigated.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code: