A goal geometric programming problem (G2P2) with logarithmic deviational variables and its applications on two industrial problems
Payel Ghosh, Tapan Kumar Roy
Abstract
Open-access reader
Payel Ghosh, Tapan Kumar Roy
Abstract
Open-access reader
A very useful multi-objective technique is goal programming. There are many methodologies of goal programming such as weighted goal programming, min-max goal programming, and lexicographic goal programming. In this paper, weighted goal programming is reformulated as goal programming with logarithmic deviation variables. Here, a comparison of the proposed method and goal programming with weighted sum method is presented. A numerical example and applications on two industrial problems have also enriched this paper.
OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A very useful multi-objective technique is goal programming. There are many methodologies of goal programming such as weighted goal programming, min-max goal programming, and lexicographic goal programming. In this paper, weighted goal programming is reformulated as goal programming with logarithmic deviation variables. Here, a comparison of the proposed method and goal programming with weighted sum method is presented. A numerical example and applications on two industrial problems have also enriched this paper.
Key concepts: Goal programming, Lexicographical order, Inductive programming, Constraint programming, Computer science, Logarithm, Reactive programming, Programming paradigm