Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3811Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Otto, Kevin | - |
| dc.date | 2003-12-10T18:58:35Z | - |
| dc.date | 2003-12-10T18:58:35Z | - |
| dc.date | 2000 | - |
| dc.date.accessioned | 2013-10-09T02:32:41Z | - |
| dc.date.available | 2013-10-09T02:32:41Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | http://hdl.handle.net/1721.1/3811 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | This paper presents an approach to determine the proper number of levels required on independent product architectural attributes, given their ability to generate added revenue through more direct targeting to smaller segments, and given the added costs of doing so. This is done in as simple and readily implementable manner as possible, making use only of conjoint data and cost estimates. From this, the order in which to consider added breakouts across the different attributes are prioritized. From this, for any minimum level of profit worth considering, a set of attribute levels to offer on each architectural attribute can be selected. Then, for any selected set of attribute levels to offer, the most effective product family using those levels is determined from the permutations. | - |
| dc.description | Center for Innovation in Product Development | - |
| dc.format | 63441 bytes | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.subject | platform architectures | - |
| dc.subject | product families | - |
| dc.subject | common product architecture | - |
| dc.subject | portfolio architecture | - |
| dc.subject | modularity | - |
| dc.subject | product platform | - |
| dc.title | Architecting Option Content | - |
| dc.type | Working Paper | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.