Different transformations for solving non-convex trim-loss problems by MINLP

Article Abstract:

Trim-loss problems or cutting stock problems involves solutions to the cutting of product paper rolls from raw paper rolls and the minimization of costs for over production. Trim loss problems associated with the paper industry in a Finnish paper converting firm are presented to explain the dissimilarities in numerical solutions. Results reveal that while the problem can be converted from linear to convex forms and be solved either as mixed-integer or convex-mixed integer non linear programming models, numerical efficiency solutions differ according to transformation.

Research and Development in the Physical, Engineering, and Life Sciences, Mathematics, Integer programming, Mathematical optimization, Nonlinear programming

---

Using OPTRANS object as KB-DSS development environment for designing DSS for production management

Article Abstract:

A model was proposed to effectively design decision support (DSS) applications in the field of production through the use of OPTRANS object. The model works by separating the interface and resources that are utilized by the DSS application. It also works to a situation where a product is created by assembling components through introduction of two-dimensional variables and an elementary matrix algebra within OPTRANS.

Prepackaged software, Business management software, Information management software, Decision support systems

---

A result on projection for the vehicle routing problem

Article Abstract:

The vehicle routing problem (VRP) is analyzed using the commodity flow formulation originally proposed by Gavish and Graves. It is shown that the equivalent formulation satisfies the so called multistar constraints which induce facets of the non-directed VRP prototype, assuming that the strongest form of the coupling constraints is used in the flow formulation. A more compact representation is also presented.

Similar abstracts:

• Abstracts: An approximation algorithm for solving unconstrained two-dimensional knapsack problems. Tree knapsack approaches for local access network design
• Abstracts: Search-hide games on trees. A linear approximation method for solving a special class of the chance constrained programming problem
• Abstracts: Segmenting organisations for institutional products and services: a framework. Virtual reality shopping simulation for the modern marketer
• Abstracts: Different stations, different effects? Creating a single television audience measurement currency in China. The mind's eye - can television advertising be visually transferred by the medium of radio?
• Abstracts: Infesibility analysis for systems of quadratic convex inequalities. QHOPDM - a higher order primal-dual method for large scale convex quadratic programming

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.