Programming problem with indefinite objective function

Authors

  • S. Aggarwal
  • S. Arora

Abstract

This paper is mainly concerned with an indefinite quadratic programming problem. The objective function to be optimized is the product of two linear functions each function being supposed to be strictly positive over the feasible region. The problem has been reduced to a convex or concave programming problem and solved by a simplex like technique.

Downloads

Published

1975-10-01

How to Cite

Aggarwal, S., & Arora, S. (1975). Programming problem with indefinite objective function. JORBEL - Belgian Journal of Operations Research, Statistics, and Computer Science, 15(3), 1–13. Retrieved from https://www.orbel.be/jorbel/index.php/jorbel/article/view/215

Issue

Vol. 15 No. 3 (1975)

Section

Articles