In this paper, Karush-Kuhn-Tucker type robust necessary optimality conditions for a robust nonsmooth interval-valued optimization problem (UCIVOP) are formulated using the concept of LU-optimal solution and the generalized robust Slater constraint qualification (GRSCQ). These Karush-Kuhn-Tucker type robust necessary conditions are shown to be sufficient optimality conditions under generalized convexity. The Wolfe and Mond-Weir type robust dual problems are formulated over cones using generalized convexity assumptions, and usual duality results are established. The presented results are illustrated by non-trivial examples.
As duality is an important and interesting feature of optimization problems, in this paper, we continue the effort of Long and Huang [X. J. Long, N. J. Huang, Optimality conditions for efficiency on nonsmooth multiobjective programming problems, Taiwanese J. Math., 18 (2014) 687-699] to discuss duality results of two types of dual models for a nonsmooth multiobjective programming problem using convexificators.
31 July 2024 in European Journal of Pure and Applied Mathematics
A great deal of inventory costs are typically unpredictable because of the unpredictability of a competitive market. The fluctating demand from customer's and the unpredictability of the market economy make it difficult for researchers and operation research practitioners to appropriately replicate an inventory problem. In order to prevail this type of unpredictability circumstances, in this paper, we have represented the inventory parameters as interval. Using this concept, we progressed a two-warehouse inventory model for deteriorating items with a fixed Shelf life, partially backlogging shortages and interval-valued deterioration rate. In addition to this the parameters like ordering cost, purchase cost, shortage cost, deterioration cost for both the rented and owned warehouse except the backlogging parameter have been considered as interval-valued. The uncertainty in the inventory parameters motivated us to view them as interval-valued in the present research. Based on the assumptions, the cost function of this problem is a highly nonlinear constraint optimization problem. Mathematica is used to tackle this nonlinear optimization problem. A numerical example has been presented to demonstrate the computational result. Then, a sensitivity analysis has been performed to study the effect of changes of different parameters of the model on the optimal policy.