Compromise programming (CP) aims to find solutions by minimising distances an ideal point with maximum achievement which is usually infeasible. A common assumption in CP that it highly unlikely the optimum decision will lie out of bounds compromise set given metrics p = 1 $p=1$ and ∞ $p=\infty$ Minkowski distance function. This excludes use multiplicative functions as a measure achievement. We ...

Let f(x) = a0x r0 + a1x r1 + · · · + akx rk , where each ai ∈ R, each rk ∈ N := {0, 1, . . . }, and r0 < r1 · · · < rk. Suppose u < v. Let z(f, u, v) = the number of roots of f in (u, v], counted with multiplicity. For any w ∈ R and n ∈ N, let s(f, w, n) = the number of sign-changes in the sequence f(w), f ′(w), f ′′(w), . . . , f (w) (skipping over zeros). Then the Fourier-Budan Theorem says t...

This paper presents a multi objective geometric programming model which determines the product`s selling price in two markets. We assume demand is a function of price and marketing expenditure in two markets. The cost of production is also assumed to be a function of demands in both markets. Our model is a posynomial function which is solved using Geometric Programming (GP). In our GP implement...