Using VFT as a Constraint for Goal Programming Models: A Case Study for Turkish Air Force Flying Hour Program

In its 60-year history, there have been many published documents in the literature about goal programming (GP), but contributions to the literature are still needed. This research intends to add to the literature on goal-programming models by discussing one of the key assumptions of GP regarding linearity, and by discussing some of the issues regarding incommensurability (difference in data types) and weighting. GP requires an interaction between the decision maker (DM) and the analyst to ensure that the model reflects the DM\u27s preferences. However, it may be difficult for them to interact if the mathematical model is very large and complex and includes many decision and deviation variables. Hence, we want a model that converts the DM\u27s qualitative values into quantitative ones and visualizes them. We use value-focused thinking (VFT) to overcome the difficulties previously mentioned by using it as a constraint in GP formulations. The use of the model is demonstrated through a case study of the Turkish Air Force Flying Hour Program, which is a multi-criteria optimization problem. We use VFT to specify the values of the decision maker for a given multi-objective decision problem, and then move it forward into a multi-criteria decision making problem as a constraint. The results demonstrate the computational performance, efficiency, and robustness of the methodology