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. 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.

  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. Mathematical optimization - Wikipedia

    en.wikipedia.org/wiki/Mathematical_optimization

    Mathematical optimization. Graph of a surface given by z = f ( x, y) = − ( x ² + y ²) + 4. The global maximum at ( x, y, z) = (0, 0, 4) is indicated by a blue dot. Nelder-Mead minimum search of Simionescu's function. Simplex vertices are ordered by their values, with 1 having the lowest ( best) value. Mathematical optimization ...

  7. Karush–Kuhn–Tucker conditions - Wikipedia

    en.wikipedia.org/wiki/Karush–Kuhn–Tucker...

    In mathematical optimization, the Karush–Kuhn–Tucker ( KKT) conditions, also known as the Kuhn–Tucker conditions, are first derivative tests (sometimes called first-order necessary conditions) for a solution in nonlinear programming to be optimal, provided that some regularity conditions are satisfied. Allowing inequality constraints, the ...

  8. Material requirements planning - Wikipedia

    en.wikipedia.org/wiki/Material_requirements_planning

    Material requirements planning. Material requirements planning ( MRP) is a production planning, scheduling, and inventory control system used to manage manufacturing processes. Most MRP systems are software -based, but it is possible to conduct MRP by hand as well. An MRP system is intended to simultaneously meet three objectives:

  9. Multi-commodity flow problem - Wikipedia

    en.wikipedia.org/wiki/Multi-commodity_flow_problem

    The problem can be solved e.g. by minimizing . A common linearization of this problem is the minimization of the maximum utilization , where. In the minimum cost multi-commodity flow problem, there is a cost for sending a flow on . You then need to minimize. In the maximum multi-commodity flow problem, the demand of each commodity is not fixed ...