APPLICATIONS OF SIMLEX METHOD AND INTEGER PROGRAMMING ON OPTIMATION PROBLEMS IN TEXTILE INDUSTRY
Optimation problem to get the biggest fortune with the smallest cost in the main goal of every company. But the effort often meets mystified which hold. The lack of sources such as : material, cost production, employer, machine capacity, and working time and other mystification from the consumer ord...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Subjects: | |
| Online Access: | https://digilib.itb.ac.id/gdl/view/12335 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | Optimation problem to get the biggest fortune with the smallest cost in the main goal of every company. But the effort often meets mystified which hold. The lack of sources such as : material, cost production, employer, machine capacity, and working time and other mystification from the consumer order. One thing which corresponds to the problem above is combination determination problem on the number of the product.<p>This project discusses about two methods to solve the problem determining the number of product combination which produce. First, simplex method, its is a method to find optimal solution with some obstructions. The simplex method produces optimal solution with some decision variable in rational values. Second, cutting plane method on integer programming. A method that used by creating addition obstruction which cut feasible space so the non integer solution could be eliminated, since decision variable acquired is integer. |
|---|