Control of inventories under non-convex polynomial cost functions.

Hernández Flórez, Mónica

The search session has expired. Please query the service again.

Displaying similar documents to “Control of inventories under non-convex polynomial cost functions.”

(s,S)-type policy for a production inventory problem with limited backlogging and with stockouts

Ryszarda Rempała (1997)

Applicationes Mathematicae

Similarity:

A production inventory problem with limited backlogging and with stockouts is described in a discrete time, stochastic optimal control framework with finite horizon. It is proved by dynamic programming methods that an optimal policy is of (s,S)-type. This means that in every period the policy is completely determined by two fixed levels of the stochastic inventory process considered.

Optimal control of an inventory system with ameliorating and deteriorating items.

Tadj, Lotfi, Sarhan, Ammar M., El-Gohary, Awad (2008)

APPS. Applied Sciences

Similarity:

A one dimensional deterministic free boundary problem.

Ferreyra, Guillermo, Pascal, Jesus A. (2002)

Divulgaciones Matemáticas

Similarity:

Guaranteed control policy with arbitrary set of correction points for linear-quadratic system with delay

Kil Chong, Olga Kostyukova, Mariya Kurdina (2010)

Control and Cybernetics

Similarity:

The fixed point property in convex multi-objective optimization problem.

Slavov, Zdravko Dimitrov (2008)

Acta Universitatis Apulensis. Mathematics - Informatics

Similarity:

A method solving optimal control problems.

Popoviciu, Ioan (2002)

Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică

Similarity:

Sensitivity analysis in multi-parametric strictly convex quadratic optimization

B. Kheirfam (2010)

Matematički Vesnik

Similarity:

On the development of Pontryagin's Maximum Principle in the works of A. Ya. Dubovitskii and A. A. Milyutin

Andrei Dmitruk (2009)

Control and Cybernetics

Similarity:

Three different operations research models for the same $(s, S)$ policy.

Ben-Ayed, Omar (2001)

Journal of Applied Mathematics and Decision Sciences

Similarity:

PDI&PDE-constrained optimization problems with curvilinear functional quotients as objective vectors.

Pitea, Ariana, Udrişte, Constantin, Mititelu, Ştefan (2009)

Balkan Journal of Geometry and its Applications (BJGA)

Similarity:

Control problem for event-switched processes.

Valuev, Andrey M. (2005)

Acta Universitatis Apulensis. Mathematics - Informatics

Similarity:

On localizing global Pareto solutions in a given convex set

Agnieszka Drwalewska, Lesław Gajek (1999)

Applicationes Mathematicae

Similarity:

Sufficient conditions are given for the global Pareto solution of the multicriterial optimization problem to be in a given convex subset of the domain. In the case of maximizing real valued-functions, the conditions are sufficient and necessary without any convexity type assumptions imposed on the function. In the case of linearly scalarized vector-valued functions the conditions are sufficient and necessary provided that both the function is concave and the scalarization is increasing...