This dissertation examines characteristics of a class of semi-infinite linear programming problems designated as C/C semi-infinite linear programming problems. Semi-infinite programming problems which belong to this class are problems of the form
[See document]
where S is a compact, convex subset of Euclidean m space and u<sub>i</sub> : S→R, i=1,...,n are strictly concave functions while u <sub> n+1</sub> : S→R is convex.
Certain properties of the C/C semi-infinite linear programming problems give rise to efficient solution techniques. The solution techniques are given as well as examples of their use.
Of significant importance is the intimate relationship between the class of C/C semi-infinite linear programming problems and certain convex fuzzy set programming problems. The fuzzy set programming problem is defined as
[See document]
The convex fuzzy set programming problem is transformed to an equivalent semi-infinite linear programming problem. Characterizations of the membership functions are given which cause the equivalent semi-infinite linear programming problems to fall within the realm of C/C semi-infinite linear programming problems. Some extensions of the set inclusive programming problem are also given. / Ph. D.
| Identifer | oai:union.ndltd.org:VTETD/oai:vtechworks.lib.vt.edu:10919/110289 |
| Date | January 1981 |
| Creators | Parks, Melvin Lee |
| Contributors | Industrial Engineering and Operations Research |
| Publisher | Virginia Polytechnic Institute and State University |
| Source Sets | Virginia Tech Theses and Dissertation |
| Language | English |
| Detected Language | English |
| Type | Dissertation, Text |
| Format | iii, 138 pages, 2 unnumbered leaves, application/pdf, application/pdf |
| Rights | In Copyright, http://rightsstatements.org/vocab/InC/1.0/ |
| Relation | OCLC# 07985375 |
Page generated in 0.0026 seconds