An Unconstrained Q - G Programming Problem and its Application

Abstract

In practice there exist many methods to solve unconstrained, constrained and mixed quadratic and geometric programming problems. In this paper an attempt is made to develop unconstraint Q – G programming problem by combining quadratic programming problem and geometric programming problem. This model is solved using the technique of geometric programming problem. A hypothetical example is considered to illustrate the model.

Keywords: Unconstrained Quadratic Programming problems, Geometric Programming problem, Primal and Dual problem, Orthogonality and normality conditions.