Bi-parametric linear programming right-hand side case / Penon Noreen U. Pacatang

By:

Pacatang, Penon Noreen U

Material type: Text

TextLanguage: English Publication details: 2002Description: 19 leavesSubject(s):

Undergraduate Thesis AMAT200

Dissertation note: Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2002 Abstract: This paper presents an algorithm for solving bi-parametric linear programming with variations in the right-hand side. The algorithm determines in terms of the parameters values associated with the optimal basis of the bi-parametric linear programming with variation in the right-hand side. The bi-parametric linear programming is formulated as a linear programming problem having right side resources involving two parameters. This simplex method and dual simplex method were used to obtain the optimal solution of the linear program. The parameterized optimal solutions were obtained from the feasibility condition of the optimal solution expressed in terms of parameters. To cover or exhaust the whole parameter space, a technique of enumerating and listing all the neighbors of the optimal basis was developed. This approach to the bi-parametric linear programming is summarized as an algorithm. Finally, a simple example was given to illustrate the approach.

List(s) this item appears in: BS Applied Mathematics

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 2 )
Title notes ( 2 )
Comments ( 0 )
Images

Holdings
Cover image	Item type	Current library	Collection	Call number	Status	Date due	Barcode
		University Library Theses	Room-Use Only	LG993.5 2002 A64 P33 (Browse shelf(Opens below))	Not For Loan		3UPML00010952
		University Library Archives and Records	Preservation Copy	LG993.5 2002 A64 P33 (Browse shelf(Opens below))	Not For Loan		3UPML00020932

Browsing College of Science and Mathematics shelves, Shelving location: Theses, Collection: Room-Use Only Close shelf browser (Hides shelf browser)

Previous	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	Next
Previous	LG993.5 2002 A64 M37 Computation of partial moments of some probability distributions /	LG993.5 2002 A64 M65 Lexicographic ordering of an n-element set with repetition /	LG993.5 2002 A64 O25 On different gridding schemes for piecewise bivariate interpolation /	LG993.5 2002 A64 P33 Bi-parametric linear programming right-hand side case /	LG993.5 2002 A64 R35 A numerical approximation of the renewal function : solution to the renewal equation /	LG993.5 2002 A64 R356 Lexicographic ordering of an n-element set /	LG993.5 2002 A64 S23 Economic load dispatch of power plants : an optimization model based on Mindanao grid information /	Next

Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2002

This paper presents an algorithm for solving bi-parametric linear programming with variations in the right-hand side. The algorithm determines in terms of the parameters values associated with the optimal basis of the bi-parametric linear programming with variation in the right-hand side. The bi-parametric linear programming is formulated as a linear programming problem having right side resources involving two parameters. This simplex method and dual simplex method were used to obtain the optimal solution of the linear program. The parameterized optimal solutions were obtained from the feasibility condition of the optimal solution expressed in terms of parameters. To cover or exhaust the whole parameter space, a technique of enumerating and listing all the neighbors of the optimal basis was developed. This approach to the bi-parametric linear programming is summarized as an algorithm. Finally, a simple example was given to illustrate the approach.

There are no comments on this title.

to post a comment.

Click on an image to view it in the image viewer