Databases
StackOverflow2013
Postsdbo
POModelling combinatorial optimization? problem
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POModelling combinatorial optimization? problem
    primarykey
    data
    text
    <p>I've been unable to match this problem into some canonical one, and I would like some guides to build/use an algorithm and solve it. Description is as follows:</p> <hr> <p>We have some people who want breakfast. Each one may order any number of coffee, juice and toast. We accumulate the order for all the group.</p> <p><code>InitialOrder = { C1, J1, T1 } with C1, J1, T1 being integer non-negative numbers.</code></p> <p>Each component has a given price, so the total price of the initial order is</p> <p><code>InitialPrice = C1 * Pc + J1 * Pj + T1 * Pt with Pc, Pj, Pt being rational positive numbers</code></p> <p>Cafeteria has also 'breakfast menus' consisting in combinations of standard items</p> <pre>full breakfast = coffee + juice + toast normal breakfast = coffee + toast bread breakfast = 2 toast </pre> <p>Choosing these menus is cheaper than choosing each component separately, so we have</p> <pre>Pf &lt; Pc + Pj + Pt Pn &lt; Pc + Pt Pb &lt; 2 * Pt with Pf, Pn, Pb being rational positive numbers </pre> <p>People want to group the initial order into menus to minimize the total amount spent. Then</p> <p><code>FinalOrder = { C2, J2, T2, F, N, B } with C2, J2, T2, F, N, B integer non-negative numbers</code></p> <p>and we'll have a FinalPrice &lt;= InitialPrice as</p> <p><code>FinalPrice = C2 * Pc + J2 * Pj + T2 * Pt + F * Pf + N * Pn + B * Pb with Pc, Pj, Pt, Pf, Pn, Pb as rational positive numbers</code></p> <p>All prices (Pc, Pj, Pt, Pf, Pn and Pb) are known in advance.</p> <hr> <p>Please, do you know Which approach should I follow to build an algorithm to minimize FinalPrice for a given InitialOrder? Feel free to ask any more details you need.</p> <p>Thank you in advance.</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. This table or related slice is empty.
    1. USfglez
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POModelling combinatorial optimization? problem
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POModelling combinatorial optimization? problem
      1. This table or related slice is empty.
      1. VTUpMod
    1. This table or related slice is empty.
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload