Determining the set of all optimal solutions of a linear program with interval data is one of the main problems discussed in interval optimization. We review two methods based on duality in linear programming, which are used to approximate the optimal set. Additionally, another decomposition method based on complementary slackness is proposed. This method provides the exact description of the o...

I received much help in composing this solution set from Yoav Kerner, Binyamin Oz and Liron Ravner. Credit is given when due next to the appropriate questions. I am indebted to all three of them.

Assignment Problem (AP) is a very well-known and also useful decision making problem in real life situations. It becomes more effective when different criteria are added. To solve Multi-Criteria Assignment Problem (MCAP), the different criteria have been considered as neutrosophic elements because Neutrosophic Set Theory (NST) is a generalization of the classical sets, conventional fuzzy sets, ...

Solution: The shock causes a leftward shift in the IS curve. Recall that the SRAS is horizontal and LRAS is vertical. Also, in the long run Y always returns to its original level, and in the short run, P does not change (sticky prices), so I won’t mention these explicitly below. The question doesn’t mention efficiency wages, so we’ll assume that the FE curve is our usual output supply curve, an...

We describe here an optical device, based on time-delays, for solving the set splitting problem which is well-known NP-complete problem. The device has a graph-like structure and the light is traversing it from a start node to a destination node. All possible (potential) paths in the graph are generated and at the destination we will check which one satisfies completely the problem’s constrains.