IDEAS home Printed from https://ideas.repec.org/a/gvu/jscp00/v2y2020i2id1472.html

Nonlinear Quadratic Fractional Transportation Problem for Optimal Solution Deduction

Author

Listed:
  • A. Sathesh

Abstract

The manifold non-linear programming problems (NLPP) are dealt by people in their daily routines in the form of real time uses. The non-linear problem could deliver a remedies on the problems that require decision making, for instance corporate planning as well as finance, production and marketing, sales and inventory etc. this makes the fractional programing a research area of predominance. The fractional programming in transportation problem of disposing a one type of goods to various endpoint with varying quantities would enable to identify probable solution at a minimized cost and duration. The paper with the research study on the one such NLPP is coined as the fractional-quadratic transportation problem. (FQTP). The NLPP are highly popular since they deliver a supreme depictions of distribution problems for the real-life applications were the transportation cost remains changing. The proposed strides in the paper emphasis on deducing the solutions that are optimal for such difficulty. The proposed algorithm is examined with the numerical instance to demonstrate the proficiency of the algorithm and its benefits in the transportation structure belonging to different area of application

Suggested Citation

Handle: RePEc:gvu:jscp00:v:2:y:2020:i:2:id:1472
DOI: 10.36548/jscp.2020.2.002
as

Download full text from publisher

File URL: https://irojournals.com/jscp/article/view/1472
File Function: Abstract page
Download Restriction: no

File URL: https://irojournals.com/jscp/article/download/1472/1321
File Function: Full text
Download Restriction: no

File URL: https://libkey.io/10.36548/jscp.2020.2.002?utm_source=ideas
LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
---><---

More about this item

Keywords

;
;
;
;
;

Statistics

Access and download statistics

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gvu:jscp00:v:2:y:2020:i:2:id:1472. See general information about how to correct material in RePEc.

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

We have no bibliographic references for this item. You can help adding them by using this form .

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Manager (email available below). General contact details of provider: https://irojournals.com/jscp .

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.