The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper a Goal Programming approach to find a prime cover solution of the Linear Fractional Multi-Objective Set Covering Problem is discussed. A Goal Programming Problem equivalent to the given problem is formulated. It is illustrated with the help of an example.
In this paper an algorithm to solve a Bilevel Programming Problem in which the leader’s and the follower’s both objective functions are linear fractional is developed. The algorithm is based on Preemptive Goal Programming. The Bilevel Programming problem is solved by converting it into a goal programming problem. An example to illustrate it is also presented.
In this paper, a branch and bound algorithm for a special class of warehouse location problems when the objective function is fractional, is developed. The branching decision rules help us to decide which warehouse has to be opened or closed from any node of branching tree. We propose the revised version of the algorithm suggested by Basheer M. Khumawala (1972). It is illustrated with the help of...
In this paper a multilevel programming problem viz. three level programming problem (TPP) is considered. It involves three optimization problems where the constraint region of the first level problem is implicitly determined by two other optimization problems. The objective function of the first level is indefinite quadratic, the second one is linear and the third one is linear fractional. The feasible...
In this paper, the considered problem is the reduction of 0–1 Quadratic Fractional Programming Problem (0–1 QF) to 0–1 Linear Mixed Programming problem (0–1 MLP). The method used to solve the linearized problem is based upon the branch and bound method. Numerical problems are solved with the help of the software ‘Lindo’.
In this paper a technique for converting Quadratic Set Partitioning Problem with fractional objective function into a Quadratic Set Covering Problem with fractional objective function having same optimal solutions has been described. The procedure so developed is illustrated with the help of a numerical example.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.