Question

In multi-item deterministic inventory problem, if the upper limit of average
storage space is given say A then with usual notations, the constraint can be
expressed as i=1 ai xi

OS2A
O = A
O ZA
OSA/2​

Answer 1

Answer:LetA be a set of feasible alternatives or decisions, and supposen different indices, measures, or objectives are associated with each possible decision ofA. How can a “best” feasible decision be made? What methods can be used or experimented with to reach some decision?

The purpose of this paper is to attempt a synthesis of the main approaches to this problem which have been studied to date. Four different classes of approaches are distinguished: (1) aggregation of multiple objective functions into a unique function defining a complete preference order; (2) progressive definition of preference together with exploration of the feasible set; (3) definition of a partial order stronger than the product of then complete orders associated with then objective functions; and (4) maximum reduction of uncertainty and incomparability.

Step-by-step explanation:

Answer 2

Answer:

here's ur answer dude

Step-by-step explanation:

option c is correct dude

ZA

hope it helps