Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

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.

Author: Inuiguchi, Masahiro, Sakawa, Masatoshi
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995
Linear programming

User Contributions:

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

CAPTCHA


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.

Author: Inuiguchi, Masahiro, Sakawa, Masatoshi, Uemura, Yoshio, Abboud, Nicolas
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
Research and Development in the Physical, Engineering, and Life Sciences, Manpower Planning, Statistics, Usage, Human resource planning, Human resource management, Resource allocation, Statistics (Mathematics), Simulated annealing (Mathematics)

User Contributions:

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

CAPTCHA


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.

Author: Inuiguchi, Masahiro, Yamada, Syuuji, Tanino, Tetsuzo
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2001
Operations Research, Management science, Branch and bound algorithms

User Contributions:

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

CAPTCHA


Subjects list: Research, Mathematical optimization, Optimization theory, Methods
Similar abstracts:
  • Abstracts: Cornell's invitation to Taiwan president puts U.S. in a bind. Wei's conviction is likely to heighten Sino-U.S. tension
  • Abstracts: Lockheed to build Asiawide system of cellular phones. Zee TV's founder takes new approach with move into mobile communications
  • Abstracts: Taiwan's EVA Airways shows no sign of slowing down after rapid expansion. Inflight disturbances grow: as fliers demand rights, crews tell of violence
  • Abstracts: Visitation rights: Clinton and Jiang agree on state visits. A case of nerves. High anxiety
  • Abstracts: Bleak expectations. In the trenches: Pakistan's Sharif wants a war on debt; but does he have the weapons? Costly retreat
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.