Solving multi-choice multi-objective transportation problem (Q2204225): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q346124
Import240304020342 (talk | contribs)
Set profile property.
 
(One intermediate revision by one other user not shown)
Property / author
 
Property / author: Mahendra Prasad Biswal / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Latest revision as of 06:14, 5 March 2024

scientific article
Language Label Description Also known as
English
Solving multi-choice multi-objective transportation problem
scientific article

    Statements

    Solving multi-choice multi-objective transportation problem (English)
    0 references
    0 references
    0 references
    15 October 2020
    0 references
    Summary: A multi-objective transportation problem involving some multi-choice parameters is considered in this paper. Some of the demand parameters of the problem assumed as multi-choice type. Due to the presence of multi-choice parameters and conflicting objective functions can not be solved directly. In order to solve the problem with such type of problem, at first interpolating polynomials are formulated for the multi-choice parameters of demand the constraints. After establishing interpolating polynomials of the multi-choice parameters a multi-objective transportation problem is formulated. The problem is treated as a multi-objective nonlinear programming problem due to involvement of interpolating polynomial. Finally, fuzzy programming is applied to find a compromise solution. The solution procedure is supported by a numerical example.
    0 references
    fuzzy programming
    0 references
    multi-objective programming
    0 references
    multi-choice programming
    0 references
    nonlinear programming
    0 references
    multi-objective transport problem
    0 references
    multi-choice transport problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references