On the mixed binary goal programming problems

doi:10.1016/j.amc.2003.11.001

2004-12-01

PRE

Ching‐Ter Chang

DOI：10.1016/j.amc.2003.11.001

原文链接

原文求助

摘要

En 中文

Goal programming (GP) is an important technique for solving many real-world problems. This paper proposes a new idea to show how to program the mixed binary GP (MBGP) model for solving a decision/management problem, which involved the achievement of goals, some of them are met or not met. The proposed model uses the concept of mixed integer linearization techniques to transform the MBGP model to the GP model. The GP model is then solvable by linear programming method. Finally, illustrative examples are included for demonstrating the usefulness of the proposed model. (C) 2003 Elsevier Inc. All rights reserved.

Keyword:

goal programming

binary

linearization