In this paper a nonlinear model is presented to demonstrate the relation between production and marketing departments. By introducing some functions such as pricing cost and market share loss functions it will be tried to show some aspects of market modelling which has not been regarded before. The proposed model will be a constrained signomial geometric programming model. For model solving, af...

we consider an approximation scheme using haar wavelets for solving a class of infinite horizon optimal control problems (ocp's) of nonlinear interconnected large-scale dynamic systems. a computational method based on haar wavelets in the time-domain is proposed for solving the optimal control problem. haar wavelets integral operational matrix and direct collocation method are utilized to ...

in this paper the real-world occurrence of the multiple-product multiple-constraint single period newsboy problem with two objectives, in which there is incremental discounts on the purchasing prices, is investigated. the constraints are the warehouse capacity and the batch forms of the order placements. the first objective of this problem is to find the order quantities such that the expected ...

Here Θ : X → IR is a continuously differentiable mapping, X ⊆ IR is an open set containing the feasible region Ω and Ω is an n-dimensional box, Ω = {x ∈ IR : l ≤ x ≤ u}. These inequalities are meant component-wise and l ∈ (IR ∪−∞), u ∈ (IR ∪∞). Taking into account the variety of applications yielding the problem (1), we allow any relationship between m and n. The relevance of this problem is we...

We propose a framework for building preconditioners for sequences of linear systems of the form (A+∆k)xk = bk, where A is symmetric positive semidefinite and ∆k is diagonal positive semidefinite. Such sequences arise in several optimization methods, e.g., in affine-scaling methods for bound-constrained convex quadratic programming and bound-constrained linear least squares, as well as in trust-...

where c ∈ R, g : R → R is non-linear and smooth on its domain, and Ω is a nonempty closed convex subset in R. This paper introduces sequential convex programming (SCP), a local optimization method for solving the nonconvex problem (P). We prove that under acceptable assumptions the SCP method locally converges to a KKT point of (P) and the rate of convergence is linear. Problems in the form of ...

This paper presents a framework that unifies various search mechanisms for solving constrained nonlinear programming (NLP) problems. These problems are characterized by functions that are not necessarily differentiable and continuous. Our proposed framework is based on the first-order necessary and sufficient condition for constrained local minimization in discrete space that shows the equivale...