enow.com 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. Economic production quantity - Wikipedia

    en.wikipedia.org/wiki/Economic_production_quantity

    The economic production quantity model (also known as the EPQ model) determines the quantity a company or retailer should order to minimize the total inventory costs by balancing the inventory holding cost and average fixed ordering cost. The EPQ model was developed and published by E. W. Taft, a statistical engineer working at Winchester ...

  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. Economic batch quantity - Wikipedia

    en.wikipedia.org/wiki/Economic_batch_quantity

    Economic batch quantity. In inventory management, Economic Batch Quantity (EBQ), also known as Optimum Batch Quantity (OBQ) is a measure used to determine the quantity of units that can be produced at the minimum average costs in a given batch or product run. EBQ is basically a refinement of the economic order quantity (EOQ) model to take into ...

  6. Mathematical optimization - Wikipedia

    en.wikipedia.org/wiki/Mathematical_optimization

    The satisfiability problem, also called the feasibility problem, is just the problem of finding any feasible solution at all without regard to objective value. This can be regarded as the special case of mathematical optimization where the objective value is the same for every solution, and thus any solution is optimal.

  7. Cutting stock problem - Wikipedia

    en.wikipedia.org/wiki/Cutting_stock_problem

    The minimum pattern count problem: to find a minimum-pattern-count solution amongst the minimum-waste solutions. This is a very hard problem, even when the waste is known. [ 10 ] [ 11 ] [ 12 ] There is a conjecture that any equality-constrained one-dimensional instance with n sizes has at least one minimum waste solution with no more than n + 1 ...

  8. Reorder point - Wikipedia

    en.wikipedia.org/wiki/Reorder_point

    Reorder point. The reorder point ( ROP ), also reorder level (ROL) or "optimal re-order level", [ 1] is the level of inventory which triggers an action to replenish that particular inventory. It is a minimum amount of an item which a firm holds in stock, such that, when stock falls to this amount, the item must be reordered.

  9. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    v. t. e. Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers. The goal is to either pack a single container as densely as possible or pack all objects using as few containers as possible. Many of these problems can be related to real-life packaging, storage and ...