Know-Legal Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Economic order quantity - Wikipedia

    en.wikipedia.org/wiki/Economic_order_quantity

    Economic order quantity. Economic order quantity ( EOQ ), also known as financial purchase quantity or economic buying quantity, [citation needed] is the order quantity that minimizes the total holding costs and ordering costs in inventory management. It is one of the oldest classical production scheduling models.

  3. Newsvendor model - Wikipedia

    en.wikipedia.org/wiki/Newsvendor_model

    Newsvendor model. The newsvendor (or newsboy or single-period [1] or salvageable) model is a mathematical model in operations management and applied economics used to determine optimal inventory levels. It is (typically) characterized by fixed prices and uncertain demand for a perishable product. If the inventory level is , each unit of demand ...

  4. Knapsack problem - Wikipedia

    en.wikipedia.org/wiki/Knapsack_problem

    Definition. The most common problem being solved is the 0-1 knapsack problem, which restricts the number of copies of each kind of item to zero or one. Given a set of items numbered from 1 up to , each with a weight and a value , along with a maximum weight capacity , subject to and . Here represents the number of instances of item to include ...

  5. Dynamic lot-size model - Wikipedia

    en.wikipedia.org/wiki/Dynamic_lot-size_model

    Dynamic lot-size model. The dynamic lot-size model in inventory theory, is a generalization of the economic order quantity model that takes into account that demand for the product varies over time. The model was introduced by Harvey M. Wagner and Thomson M. Whitin in 1958. [1] [2]

  6. Minimum-cost flow problem - Wikipedia

    en.wikipedia.org/wiki/Minimum-cost_flow_problem

    The minimum-cost flow problem ( MCFP) is an optimization and decision problem to find the cheapest possible way of sending a certain amount of flow through a flow network. A typical application of this problem involves finding the best delivery route from a factory to a warehouse where the road network has some capacity and cost associated.

  7. List of NP-complete problems - Wikipedia

    en.wikipedia.org/wiki/List_of_NP-complete_problems

    The problem for graphs is NP-complete if the edge lengths are assumed integers. The problem for points on the plane is NP-complete with the discretized Euclidean metric and rectilinear metric. The problem is known to be NP-hard with the (non-discretized) Euclidean metric. [3] : . ND22, ND23. Vehicle routing problem.

  8. Price controls - Wikipedia

    en.wikipedia.org/wiki/Price_controls

    Price controls are restrictions set in place and enforced by governments, on the prices that can be charged for goods and services in a market. The intent behind implementing such controls can stem from the desire to maintain affordability of goods even during shortages, and to slow inflation, or, alternatively, to ensure a minimum income for ...

  9. Inventory theory - Wikipedia

    en.wikipedia.org/wiki/Inventory_theory

    The inventory control problem is the problem faced by a firm that must decide how much to order in each time period to meet demand for its products. The problem can be modeled using mathematical techniques of optimal control, dynamic programming and network optimization. The study of such models is part of inventory theory.