Interactive algorithms for multiple criteria nonlinear programming problems

S. Sadagopan, Arunachalam Ravindran

Research output: Contribution to journalArticle

31 Citations (Scopus)

Abstract

In this paper, several interactive procedures for solving multiple criteria nonlinear programming problems have been developed. These are based on the generalized reduced gradient method for solving single objective nonlinear programming problems. They can handle maximization problems with nonlinear concave objectives, nonlinear convex constraints and an implicit quasi-concave preference function of the decision maker. The interactive procedures work with information of varying degrees of accuracy from the decision maker, thereby extending and strengthening a number of existing methods.

Original languageEnglish (US)
Pages (from-to)247-257
Number of pages11
JournalEuropean Journal of Operational Research
Volume25
Issue number2
DOIs
StatePublished - Jan 1 1986

Fingerprint

Multiple Criteria Programming
Nonlinear programming
Nonlinear Programming
programming
Gradient methods
decision maker
Convex Constraints
Nonlinear Constraints
Gradient Method
Strengthening
Decision maker
Multiple criteria

All Science Journal Classification (ASJC) codes

  • Information Systems and Management
  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Applied Mathematics
  • Modeling and Simulation
  • Transportation

Cite this

Sadagopan, S. ; Ravindran, Arunachalam. / Interactive algorithms for multiple criteria nonlinear programming problems. In: European Journal of Operational Research. 1986 ; Vol. 25, No. 2. pp. 247-257.
@article{5e2375369fdf4055b46eda46ff97a5bd,
title = "Interactive algorithms for multiple criteria nonlinear programming problems",
abstract = "In this paper, several interactive procedures for solving multiple criteria nonlinear programming problems have been developed. These are based on the generalized reduced gradient method for solving single objective nonlinear programming problems. They can handle maximization problems with nonlinear concave objectives, nonlinear convex constraints and an implicit quasi-concave preference function of the decision maker. The interactive procedures work with information of varying degrees of accuracy from the decision maker, thereby extending and strengthening a number of existing methods.",
author = "S. Sadagopan and Arunachalam Ravindran",
year = "1986",
month = "1",
day = "1",
doi = "10.1016/0377-2217(86)90089-5",
language = "English (US)",
volume = "25",
pages = "247--257",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "2",

}

Interactive algorithms for multiple criteria nonlinear programming problems. / Sadagopan, S.; Ravindran, Arunachalam.

In: European Journal of Operational Research, Vol. 25, No. 2, 01.01.1986, p. 247-257.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Interactive algorithms for multiple criteria nonlinear programming problems

AU - Sadagopan, S.

AU - Ravindran, Arunachalam

PY - 1986/1/1

Y1 - 1986/1/1

N2 - In this paper, several interactive procedures for solving multiple criteria nonlinear programming problems have been developed. These are based on the generalized reduced gradient method for solving single objective nonlinear programming problems. They can handle maximization problems with nonlinear concave objectives, nonlinear convex constraints and an implicit quasi-concave preference function of the decision maker. The interactive procedures work with information of varying degrees of accuracy from the decision maker, thereby extending and strengthening a number of existing methods.

AB - In this paper, several interactive procedures for solving multiple criteria nonlinear programming problems have been developed. These are based on the generalized reduced gradient method for solving single objective nonlinear programming problems. They can handle maximization problems with nonlinear concave objectives, nonlinear convex constraints and an implicit quasi-concave preference function of the decision maker. The interactive procedures work with information of varying degrees of accuracy from the decision maker, thereby extending and strengthening a number of existing methods.

UR - http://www.scopus.com/inward/record.url?scp=0022712897&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022712897&partnerID=8YFLogxK

U2 - 10.1016/0377-2217(86)90089-5

DO - 10.1016/0377-2217(86)90089-5

M3 - Article

AN - SCOPUS:0022712897

VL - 25

SP - 247

EP - 257

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 2

ER -