Optimum Integer Solution of Goal Programming Problem by Modified Gomory Constraint Technique
Main Article Content
Abstract
In this paper, we made an attempt to crack Goal programming problem by using Modified Gomory Constraint Technique. This method will be a new approach and easy to crack goal programming problem. The above method will be a powerful method to find better solution. It will take less iterations and save our precious time by omiting calculations of net evaluation.
Downloads
Metrics
Article Details
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
