Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

An accelerative enumeration algorithm for the bottle combination problem and the menu planning problem

H Tsuruta1, N Ikeda, T Sato

  • 1Department of Medical Informatics, School of Medicine, Kitasato University, Kanagawa, Japan.

Computers and Biomedical Research, an International Journal
|February 1, 1993
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Evaluation of Persistent Lymphatic Fluid Leakage Using a Strategy of Placing a Drain After Kidney Transplantation: A Statistical Analysis to Assess Its Origin.

Transplantation proceedings·2017
Same author

Characteristics of Psychrophilic Alkaline Phosphatase.

Bioscience, biotechnology, and biochemistry·2016
Same author

Diet-induced alteration of fatty acid synthase in prostate cancer progression.

Oncogenesis·2016
Same author

High-level semi-synthetic production of the potent antimalarial artemisinin.

Nature·2013
Same author

Limited sampling strategies to estimate the area under the concentration-time curve. Biases and a proposed more accurate method.

Methods of information in medicine·2012
Same author

Frequent p53 mutations on exons-5 and exon-8 in human primary gastric-cancer.

International journal of oncology·2011
Same journal

Wavelet domain nonlinear filtering for evoked potential signal enhancement.

Computers and biomedical research, an international journal·2001
Same journal

Time-frequency analysis of the RT and RR variability to stratify hypertrophic cardiomyopathy patients.

Computers and biomedical research, an international journal·2001
Same journal

Controlled auxotonic twitch in papillary muscle: a new computer-based control approach.

Computers and biomedical research, an international journal·2001
Same journal

Controlling for chance agreement in the validation of medical expert systems with no gold standard: PNEUMON-IA and RENOIR revisited.

Computers and biomedical research, an international journal·2001
Same journal

Artificial neural networks compared to factor analysis for low-dimensional classification of high-dimensional body fat topography data of healthy and diabetic subjects.

Computers and biomedical research, an international journal·2000
Same journal

On the parallelization of linkmap from the LINKAGE/FASTLINK package.

Computers and biomedical research, an international journal·2000
See all related articles

Optimizing medical supply combinations for individual patient needs, like intravenous feeding, is complex. This study presents a fast algorithm to find the best mix of ready-made supplies, ensuring accurate patient nutrition and fluid balance.

Area of Science:

  • Medical supply chain optimization
  • Clinical nutrition
  • Operations research in healthcare

Background:

  • Clinical practice often requires combining ready-made medical supplies to meet specific patient needs, such as in intravenous infusion and feeding.
  • Selecting the optimal combination of supplies for fluid, electrolyte, and nutritional requirements is a complex combinatorial problem.
  • Existing methods struggle to solve this optimization problem quickly and exactly, even with computational aid.

Purpose of the Study:

  • To formulate the combinatorial problem of medical supply combination as a nonlinear all-integer programming problem.
  • To develop and present a fast, exact algorithm for solving this optimization challenge.
  • To demonstrate the algorithm's efficiency in finding optimal supply combinations for typical clinical scenarios.

Related Experiment Videos

Main Methods:

  • Formulation of the medical supply combination problem as a nonlinear all-integer programming model.
  • Development of a novel, fast, exact algorithm designed to solve the formulated problem.
  • Validation of the algorithm's performance on medical problems of standard size.

Main Results:

  • The proposed algorithm successfully formulates the complex combinatorial problem.
  • The algorithm provides an exact solution for optimal medical supply combinations.
  • The solution is achieved within an acceptable calculation time for practical clinical use.

Conclusions:

  • A fast, exact algorithm has been developed to solve the complex combinatorial problem of optimizing medical supply combinations.
  • This approach enables efficient and accurate satisfaction of individual patient fluid, electrolyte, and nutritional requirements.
  • The algorithm offers a valuable tool for clinical practice, improving the management of ready-made medical supplies.