General indefinite programming with non-linear constraints

Authors

  • S. Arora Department of Maths. University of Delhi, Delhi (India)
  • S. Aggarwal Department of Operational Research University of Delhi, Delhi (India)

Abstract

Studies of non-linear programming problems of specific systems and the mathematical techniques used in solving such problems have frequently been presented in various research Papers. This paper discusses non-linear programming problems with pseudo convex (pseudo concave) objective function. An approximation technique is developed to solve such problems.

Downloads

Published

1977-06-01

How to Cite

Arora, S., & Aggarwal, S. (1977). General indefinite programming with non-linear constraints. JORBEL - Belgian Journal of Operations Research, Statistics, and Computer Science, 17(2), 15–28. Retrieved from https://www.orbel.be/jorbel/index.php/jorbel/article/view/243

Issue

Vol. 17 No. 2 (1977)

Section

Articles