1995•OptimizationRequires access

A Goal Programming Method for Solving Fractional Programming Problems via Dynamic Programming

B.B. Pal, I. Basu

Abstract

This paper presents a Goal Programming (GP) method to solve a class of Fractional Programming (FP) problems which have the characteristics of Dynamic Programming (DP) problems. The method is designed to solve the problems when one or more objective goals appear at the same priority level and the method works in such a way that the problem is solved recursively without linearizing the fractional objectives. In the solution process, the feasible regions of the decision variables are determined by using GP rather than the traditional DP method. An example is provided to illustrate the method outlined

About this research paper

What this paper is about

Why it matters

OpenAlex reports 36 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Fractional programming, Mathematical optimization, Goal programming, Mathematics, Constraint programming, Class (philosophy), Dynamic programming, Linear-fractional programming