MODIFIED GAUSS ELIMINATION TECHNIQUE FOR SEPARABLE NONLINEAR PROGRAMMING PROBLEM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SANJAY JAIN

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF INDUSTRIAL MATHEMATICS Year:2012 | Volume:4 | Issue:3 Page(s): 163-170

Download Full-Text

Persian Verion

View:

778

Download:

226

Cites:

Information Journal Paper

Title

MODIFIED GAUSS ELIMINATION TECHNIQUE FOR SEPARABLE NONLINEAR PROGRAMMING PROBLEM

Author(s)

SANJAY JAIN | Issue Writer Certificate

Keywords

SEPARABLE NONLINEAR PROGRAMMINGQ2

ELIMINATION TECHNIQUEQ2

INEQUALITIESQ2

BREAKING POINTSQ2

Abstract

Separable programming deals with such nonlinear programming problem in which the objective function as well as constraints are separable. For solving SEPARABLE NONLINEAR PROGRAMMING Problem (SNPP) is reduced first to Linear Programming Problem (LPP) by approximating each separable function by a piecewise linear function and than usual graphical, simplex method applied. A new form of Gauss ELIMINATION TECHNIQUE for INEQUALITIES has been proposed for solving a SEPARABLE NONLINEAR PROGRAMMING Problem. The technique is useful than the earlier existing methods because it takes least time and calculations involve in are also simple. The same has been illustrated by a numerical example of SNPP.

Cites

FGP APPROACH TO MULTI OBJECTIVE QUADRATIC FRACTIONAL PROGRAMMING PROBLEM

References

Cite

APA: Copy

SANJAY, JAIN. (2012). MODIFIED GAUSS ELIMINATION TECHNIQUE FOR SEPARABLE NONLINEAR PROGRAMMING PROBLEM. INTERNATIONAL JOURNAL OF INDUSTRIAL MATHEMATICS, 4(3), 163-170. SID. https://sid.ir/paper/231790/en

Vancouver: Copy

SANJAY JAIN. MODIFIED GAUSS ELIMINATION TECHNIQUE FOR SEPARABLE NONLINEAR PROGRAMMING PROBLEM. INTERNATIONAL JOURNAL OF INDUSTRIAL MATHEMATICS[Internet]. 2012;4(3):163-170. Available from: https://sid.ir/paper/231790/en

IEEE: Copy

JAIN SANJAY, “MODIFIED GAUSS ELIMINATION TECHNIQUE FOR SEPARABLE NONLINEAR PROGRAMMING PROBLEM,” INTERNATIONAL JOURNAL OF INDUSTRIAL MATHEMATICS, vol. 4, no. 3, pp. 163–170, 2012, [Online]. Available: https://sid.ir/paper/231790/en

Related Journal Papers