Multiplicative Programming and beyond Via C-Programming

Abstract

This discussion presents a c-programming perspective on multiplicative programming. Through the usual log transformation multiplicative programming problems are reformulated as additive c-programming problems which are then amenable to methods and techniques of additive composite concave programming. This then raises the question: do multiplicative programming problems possess any features that are not captured by additive composite concave programming problems and which are useful in the development of solution methods and algorithms? We briefly address this question.