An optimal-basis identification technique for solving a blending problem

Name: Chinchet Boonmalert

keyword: Linear programming

; Relaxation problem

; Blending problem

; Artificial-free technique

; Simplex method

Abstract: Blending problem is one of production problems, which can be formulated to a linear programming model and solved by the simplex method. For starting the simplex method, an initial basis corresponding to a basic feasible solution is chosen first. Then, the iterative process for improving the solution is performed. However, in a large scale of blending problem, it is not easy to choose an initial basis. Therefore, the easiest way to choose a basis is adding artificial variables to the problem for finding a basis of legitimate variables. This addition brings to increase the size of the problem and requires more iterations. In this thesis, we present the new initial basis for starting the simplex method without using artificial variables to solve the blending problem. Moreover, for some cases, if the problem satisfies our conditions, then the optimal basis can be identified and the optimal solution can be obtained very rapidly by computing our proposed formula. Besides the artificial variables are not required, the iterations can be avoided. Consequently, the computational time to solve the blending problem is reduced extremely

Thammasat University. Thammasat University Library

Address: BANGKOK

Email: preserv@tu.ac.th

Name: Aua-aree Boonperm

Role: advisor

Created: 2020

Modified: 2022-10-19

Issued: 2022-10-19

วิทยานิพนธ์/Thesis

application/pdf

DOI: 10.14457/TU.the.2020.27

eng

DegreeName: Master of Science

Level: Master's Degree

Descipline: Mathematics

Grantor: Thammasat University

©copyrights Thammasat University

ลำดับที่.	ชื่อแฟ้มข้อมูล	ขนาดแฟ้มข้อมูล	จำนวนเข้าถึง	วัน-เวลาเข้าถึงล่าสุด
1	9166chinchet.pdf	1.67 MB

ใช้เวลา

0.03979 วินาที